6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
	Informed Searches Best-First Search, Hill Climbing, Beam Search, A*, IDA*, RBFS, SMA* (the last three are not talked about much in lecture) We'll learn related terms such as heuristics, optimal solution, informedness, hill climbing problems (local maxima/minima, plateau, foothill problem) and admissibility. Let g(n) = estimated cost from initial state to node n Uniform cost search (branch-and-bound search) uses this measure. Let h(n) = estimated (guessed) distance from node n to closest goal The function h is our HEURISTIC. Robot Path Planning - Euclidean distance to goal 8 Puzzle - number of tiles out of place Methods which use h to guide search are called heuristic search methods.