A* Search: the overachiever with a compass. It mixes what we’ve explored with a guess of how far is left (a heuristic), so it usually beelines to the goal while still guaranteeing the shortest path when the heuristic is admissible.
Nodes Visited
0
Path Length
0
Algorithm Time (real)
0ms
Animation Time (played)
0ms
How to Use:
- Click on the grid to place Start (green) and End (red) nodes
- Click and drag to draw walls
- Select an algorithm and click Visualize to watch it find the path
- Use Generate Maze for a random maze pattern
- Adjust the Timescale (0.1×–20×): lower = slower playback; higher = faster