- a. breadth first search
- b. depth first search with a depth limit of 10
- c. depth first search with duplicate node detection
- d. best-first-graph-search
- e. a-star
- f. depth-first iterative deepening search
- g. depth-first-search (if possible)
- h. steepest-ascent-hill-climbing-search (if possible)

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

pazzani@ics.uci.edu