example:

b) Find the admissible heuristic for the following 8 puzzle problem. 5 10 9 3 8 11 2 12 6 13 1 14 7 4 4 15 1 N 3 4 5 6 7 8 9 10 11 12 13 14 15 Admissible heuristics Q: find the heuristic for the 8 puzzle problem? E.g., for the 8-puzzle: . h (n) = number of misplaced tiles ha(n) = total Manhattan distance (i.e., no. of squares from desired location of each tile) . 7 2 4 1 | 2 5 6 3 | 4 | 5 8 | 3 1 6 7 8 Start State Goal State h (S) = ? 8 h2(S) = ? 3+1+2+2+2+3+3+2 = 18