SIMULATION 17 / 20 · ALGORITHMS
A* Pathfinding: Maze Explorer
Generate a maze and compare informed A* search with Dijkstra’s uniform-cost exploration.
GRAPH SEARCH
LIVE INTERACTIVE MODELRUNNING
Adjust parameters to explore the modelReal-time mathematical model · no external libraries
What you are exploring
A* chooses the frontier node with the lowest f = g + h, combining path cost with a heuristic estimate to the goal. Dijkstra uses only g, exploring uniformly by accumulated cost. Click the grid to add or remove walls.
MYSIMULATOR · INTERACTIVE SCIENCE COLLECTION · 17