Algorithms · EXPERIMENT 20 / 20
Shortest Path Dijkstra and A* Explorer
Generate a grid maze and compare Dijkstra’s exhaustive search with A* heuristic pathfinding.
INITIALISING
LIVE MODELRUNNING
FrontierVisitedFinal path
What you’re exploring
Dijkstra expands the lowest accumulated travel cost. A* adds a heuristic estimate of the remaining distance, often reaching the same shortest path while exploring fewer cells. Click cells to add or remove obstacles.
A* priority: f(n) = g(n) + h(n)
MY SIMULATOR · INTERACTIVE SCIENCE COLLECTION · 638271