Developing a Heuristic
	• Tradeoff between quality of h and efficiency of search. • Extreme cases: – h(n) = 0  (admissible, but equivalent to uniform cost search) – h(n) = exact optimal cost remaining (search goes directly to goal, but full problem solved for each step!)