一个用C语言写的迷宫游戏

定义一个8*8的格子，这64个格子是人物可以移动到的位置；障碍物定义为两个相邻格子之间的挡板，0或1两种状态。类似上述方法，可以定义整个迷宫的布局，64个格子，对应数目的挡板，迷宫出口，迷宫入口，小人，这些元素。

文件里，需要存储迷宫大小，挡板位置，出口，入口。

小人在任一位置，可以向四个方向移动，有挡板则可以移动，没挡板则不可以移动。

最优路径的提示，使用A星路径算法去做，实质是一个启发式广度优先遍历。-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.