CS340    Lab 2 - Informed Searching

 

You will use the "Searches" module of the AI program to answer the following questions. Give clear and complete written answers.

 

1.      Solve the Romanian search problem with iterative deepening, greedy, and A* searches.  Watch the values in the queue carefully so that you understand what is happening. Which algorithms give an optimal solution?
 

 

2.      Now select the 8 Puzzle problem. You will be given two possible heuristics for the A* algorithm, Manhattan distance and Number of Misplaced Tiles. Which heuristic do you think will perform better and why? Test out your prediction and explain why you got the results that you did.