Dijkstra and A* on grid mazes
Drag across either board to draw. Editing a preset works on a copy called Your maze, so the presets and the benchmark below stay intact.
The same comparison the Python script writes to benchmark_results.csv, recalculated in your browser. Choose a maze name to replay it above.
| Maze | Path | Nodes expanded | A* node reduction | Density | Runtime | |||
|---|---|---|---|---|---|---|---|---|
| Dijkstra | A* | Dijkstra | A* | Dijkstra (µs) | A* (µs) | |||
Density is expanded nodes divided by all walkable cells. Reduction is measured against Dijkstra's expanded-node count. Runtimes are averages over repeated runs in this browser, so they vary by device and are illustrative only.