Greedy best-first vs. A* search
		Greedy best first expands the node that gives the least estimated cost to the goal: f(n) = h(n).  It ignores the step cost entirely. A* combines uniform cost search and greedy best first search f(n) = g(n) + h(n).