27 Jan 2005
CS 3243 - Heuristics
27
Admissible
heuristics
E.g.,
for the 8-puzzle:
nh1(n) = number of misplaced tiles
nh2(n) = total Manhattan distance
(i.e.,
no. of squares from desired location of each tile)
nh1(S) = ?
8
nh2(S) = ?
3+1+2+2+2+3+3+2 = 18
