Description: Maze problem demo
With a n* n phalanx, says maze, respectively 0 and 1 the pathways and obstacles said maze. Maze problem requirements give from entry (1, 1) to export (n, n), or all the pathways that no pathways conclusion.
Specific requirement is: after starting the program with a labyrinth board, showed white checked says pathways, black squares says obstacles. The user can change the way by clicking on a maze set new pathways, board, which can then be a state chart maze by users click "start execution button to display on board in the maze from entry (1, 1) to export (n, n) all of the passages.
To Search:
File list (Check if you may need any files):
Labyrinth demo.doc
Download