CMU 07-280 Lecture 2: Heuristic Search from UCS and Greedy to A*
Lecture 2 decomposes search into a problem, frontier, and priority: UCS uses paid cost, Greedy uses estimated remaining cost, and A* combines them as `f=g+h`; tree and graph search require different optimality conditions.