6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
	Heuristics Which of the following heuristics are admissible for the eight puzzle problem? h1(n) = Number of tiles in wrong position in state n h2(n) = 0 h3(n) = Sum of Manhattan distance between each tile and goal location for the tile h4(n) = 1 h5(n) = min(2, h*[n]) h6(n) = Number of x moves and y moves to get blank into correct position h7(n) = max(2, h*[n]) h1(S) = 7, h3(S) = 2+3+3+2+4+2+0+2 = 18