ICS 171: Homework #7

1. (100). Solve the Towers of Hanoi problem using your heuristic (Problem 1 of Homework #5 with best-first-graph-search (heuristic-search.lisp) and a-star (a-star.lisp). Create a table comparing the following algorithms on this problem:

For each algorithm, find the number of nodes visited, the length of the solution, and the maximum length of the node list.

Extra Credit: Implement the IDA* algorithm, test it on the train problem, the eight puzzle and the Towers of Hanoi problem. Compare it to A* in terms of time, space, and quality of solution.

Back to http://www.ics.uci.edu/~pazzani/171-p.html (text only) or http://www.ics.uci.edu/~pazzani/171.html .

Michael Pazzani
Department of Information and Computer Science,
University of California, Irvine
Irvine, CA 92717-3425