Algorithm Insight
A* Search: Uses a heuristic function f(n) = g(n) + h(n) where g(n) is the exact cost from start to node n, and h(n) is the Manhattan distance estimate to the target. It combines the speed of greedy best-first with the optimality of Dijkstra.