1
edit
Changes
→Initial version
</pre>
The most likely endpoint here would be 3, with endpoints of 2 and 4 less likely, and 1 and 5 even less likely, although the chance of getting 2,4,1, or 5 would increase with the difficulty level. If it's not possible for the ship to move fast enough to navigate X squares over in a row, then we'll remove that as a possibility, so that the maximum difference between end points in adjacent rows would be x - 1
New maze generation code!
<pre>
char buildings[40][5];
//initialize that
Path ourPaths[3];
//initialize that
for (int curRow = 0; curRow < 40; curRow++)
{
foreach(Path curPath in ourPaths)
{
curPath.buildPath(buildings[curRow]);
}
}
Path
{
int startCol;
int endCol;
public:
void buildPath(char currentRow[5])
{
currentRow[endCol] = notabuilding;
startCol = endCol;
endCol = endCol + or - a random number, probably influenced by difficulty level;
//Fill in all columns between startCol and endCol with notabuildings
}
}
</pre>
[http://zenit.senecac.on.ca/wiki/index.php/GAM666/DPS901_Project_requirements_20103#Phase_1 *How to write game proposal]
