Description: Maze problem solving process can be used backtracking that under certain constraints exploratory search forward, if the advance is blocked, then go back in time to correct the errors continue to choose another path searching method. Starting the entrance, according to a forward direction to explore, if go through, that somewhere up, the new point is reached, otherwise explore the next direction if all directions are no paths, then a little before returning along the same route, replaced in one direction and then continue to test until all possible roads to explore, or find a path, or no way out but to return the entry point. Under the former in the solution process, when you can not move forward in order to ensure continued walking after reaching a certain point, in order to be able to return to the correct one the next tentative forward direction, you need to save in the test process of each point can be achieved scale and direction of the point forward, when the temptation to find
To Search:
File list (Check if you may need any files):
勇闯迷宫游戏.cpp