A* Search

Dijkstra guided by a heuristic estimate of the remaining distance.

Advanced

Priority = cost so far + heuristic. With an admissible heuristic (never overestimates) it finds optimal paths — used in games and robot navigation.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)