CS 462 Homework 2.   

Deadline: March 6, 2003.

Problem 1: See page 95, Figure 4.2 from AIMA. Represent the graph anyway you 
like (property lists, association lists, structures) and using breadth-
first, depth-first, best-first and hill-climbing searches, find a path to 
Bucharest from a specified city. 

Problem 2: From my Web site, get the code for the 5-puzzle problem. It 
contains functions for depth-first, breadth-first and best-first searches. 
The heuristic function used by the best-first search counts the number of 
tiles in their proper places. Another heuristic function is the Manhattan 
distance discussed in class. Implement the Manhattan distance heuristic, and 
compare the performance of the best-first search for these two heuristic
functions (number of tiles in their proper places and Manhattan distance),
as well as compare the performance of best-first search with that of
breadth-first search and depth-first searches. Remember that the state 
space is divided into two separate graphs not reachable from each other.
Carefully select initial states (think of a way to ensure that the final
state is reachable from a given initial state). Present an extensive
summary of the results of your experiments.

Submit hard copies of the programs with all the runs, results summary, 
and a disk.