CS 4th Year AI Group assignment

Last summation date 27/04/2010 E.C

1. Show possible movement for the 8-puzzle problem given below depend on the heuristic:
A. Misplaced tiles
B. Manhattan distance

2 8 3 2 3
1 6 4 6 8 4
7 5 1 7 5
Initial state Goal state

C. Write what you observe from these heuristics.

2. For the following searching mechanism show the nodes visited in order to achieved the
goal state from the start state (S) using the following heuristic values to the goal state(G):
A. Greedy search B. A* search
C. Check the admissible and monotonicity of A* search
D. Write what you observe from these heuristics and what would you conclude from
this.

S G
D

6 F
C

Where the heuristic function from each node to goal state given as follows:

h(S) = 8.
h(B) = 8.
h(C) = 6.
h(D) = 5.
h(E) = 1.
h(F) = 4.
h(G) = 0.