Description: ** Maze games maze generation and the best path** Principle: the plane coordinates of each odd-numbered, such as: (1,3), (5,5) ... Set the node, in-depth search for each node, and open up all line into the path of the maze randomly. the best path: from the maze entry point start breadth-first search channel for each one to seek the best path to reach the finish line.
To Search:
- [algorithmsourcecode.Rar] - A* algorithm is the most classic Routing
- [labyrinth] - Depth-first algorithm mice Maze game. In
- [EightPuzzle] - A* algorithm is a heuristic search, whic
- [ASTAR] - Searching in a map using A*.Seek for the
- [A-Star] - a best A* find the shortest path algorit
File list (Check if you may need any files):
MazeGames.c