A* Search
	• Path Cost g(n) - cost from initial state to n • Uniform Cost Search expands minimum g(n) • Greedy Search expands minimum h(n) • Search algorithm “A” expands minimum estimated total cost f(n)=g(n)+h(n) • Worked example