Finding your way out of Labyrinth using PROLOG
Visual Prolog 7.0 Examples and Demos
There are several possible path finding or search algorithms:
- Depth first search
- Breadth first search
- Best first search (AT algorithm)
- Heuristic guided best first search (A* algorithm)
Every search algorithm uses rather much computer resources with a larger data. In this Pacman game A* algorithm which provides an efficient way to locate the target, is used. More information about Astar can be found via this link.