What does A* add over Dijkstra's algorithm?
- A heuristic estimate of the remaining distance
- Support for negative weights
- Guaranteed constant-time search
- The ability to ignore obstacles
The heuristic steers the search toward the goal, visiting fewer nodes.
Play Game Dev ▸