Introduction - If you have any usage issues, please Google them yourself
A written in C language maze game
The definition of a 8x8 grid, which is a character grid 64 can be moved to the position the obstacle is defined as a baffle between two adjacent grid, 0 or 1 two states. Similar to the above method, you can define the entire layout of the maze, 64 grid, a corresponding number of baffles, exit the maze, the maze entrance, villain, these elements.
File, the need to store the size of the maze, damper position, export, import.
Villain in either position, you can move in four directions, you can move baffled, did not baffle can be moved.
Tip optimal path using A star path algorithm to do, in essence, it is a heuristic breadth-first traversal.