Greedy Search
	• Heuristic Function h(n) - estimated cost of the cheapest path from n to a goal node • Greedy Search: Best-First Search with      f(n) = h(n) • “Always choose the node that looks closest to the goal next.” • Can think of h as the height of a “search terrain”. In greedy search, you would look for the next biggest step down from where you’ve been.