8 min readSearch and Games
Classical Search: From Breadth-First to A*
Turning a problem into a state space and letting an algorithm walk it: what completeness and optimality actually cost, why memory rather than time defeats breadth-first search, and the two conditions on a heuristic that make A* provably optimal.
Search & PlanningArtificial Intelligence