Maze Forge — Generator & Solver Visualizer

Algorithm Speed 8 N new · R replay · Space pause

Phase: idle

Ready.

Legend

Start (upper-left)
Finish (lower-right)
Unvisited cell
Carved / visited
Active carve trail
Generator head
Solver explored (brighter = farther)
Frontier (queued)
Path cell (settled by solution)
Solution path

Stats

Cells: 375
Carve steps: 0
Passages cut: 0
Search steps: 0
Cells explored: 0
Path length: —
Efficiency: —

Recursive backtracking grows one spanning-tree branch at a time: the magenta head pushes forward into unseen cells, and backtracks (dropping cells from the violet trail) when it hits a dead end. Because every cell is added exactly once through a single carved wall, the result is a perfect maze — all 375 cells reachable, unique simple path between any pair.