Maze Path-finding using Prolog
Budget: €30 – €250 EUR
You task is to implement in Prolog, and evaluate, three different search algorithms for
finding a path in a simple maze. The algorithms you are asked to implement are:
1. Depth-first OR breath-first search
2. Iterative-deepening search
3. A* - you have to decide on a suitable heuristic for A*.
Please see the PDF for full details.
finding a path in a simple maze. The algorithms you are asked to implement are:
1. Depth-first OR breath-first search
2. Iterative-deepening search
3. A* - you have to decide on a suitable heuristic for A*.
Please see the PDF for full details.
Related categories:
Prolog