Properties of A*
	• A* is optimal – finds optimal path to goal • A* is optimally efficient - no other algorithm is guaranteed to expand fewer nodes • A* is complete on locally finite graphs (finite branching factor, minimum cost constant) • Complexity exponential unless h is very accurate (error grows no faster than log of actual path cost)