Description: Program is designed to complete the maze from maze.txt file is read into the maze. Format is as follows: The first act of the maze order N, followed by an N* N matrix represents the maze, 0 is the path, one of obstructions. Experimental requirements: 1. Printing Maze: DisplayMaze () or overloaded < < where (1,0) position and the (N-2, N-1) Location Print " => the rest of the 1 position print" ## " 0 position print " " (two spaces), note that each position is two characters. printing examples: 2. Looking out of the maze of paths and output FindPath () output format: (1,1)-> (2 , 1)-> (2,2)-> ...... and outputs the number of steps required. 3 Print Maze dynamic path WalkPath () shows the dynamic process of the maze, and each time when they move accordingly modify the display status In order to allow users to see the display process, you must make the code deceleration, so about once every second move this end, the wait can be inserted in the code st
To Search:
File list (Check if you may need any files):
迷宫\maze.txt
....\迷宫.cpp
....\迷宫.pdf
迷宫
Download