Maze-solving algorithm: Difference between revisions

Revision as of 15:51, 1 July 2016

Revision as of 15:51, 1 July 2016

Line 83:

if (recursiveSolve(x, y-1)) { // Recalls method one up

correctPath[x][y] = true;

return true;jjghjghjjtyy46ytru6thtjtyhjhhhyj

}

if (y != height- 1) // Checks if not on bottom edge

if (recursiveSolve(x, y+1)) { // Recalls method one down

correctPath[x][y] = true;

return true;nhggtuyge

}

return false;