Admissible heuristics
	E.g., for the 8-puzzle: n h1(n) = number of misplaced tiles n h2(n) = total Manhattan distance (i.e., no. of squares from desired location of each tile) n h1(S) = ? 8 n h2(S) = ? 3+1+2+2+2+3+3+2 = 18