Pathfinding
Wall (W)
Start (S)
End (E)
Weight (G)
Eraser (R)
A* (Manhattan)
A* (Euclidean)
Dijkstra
BFS
DFS
Greedy Best-First
Diagonals
Speed:
20
Run
Reset
Clear All
-- Generate --
Recursive Maze
Random 30%
Random 50%
Spiral
Rooms
Visited:
0
Path:
0
Cost:
—
Time:
—
Grid:
0x0