Properties of A*
	n Complete? Yes (unless there are infinitely many nodes with f ≤ f(G) ) n Time? Exponential n Space? Keeps all nodes in memory n Optimal? Yes