Maze Forge

A 25 × 15 perfect maze carved by randomized recursive backtracking — every cell reachable, exactly one path between any two cells — then solved live.

RECURSIVE BACKTRACKER · BFS / A*
Preparing…
Legend: Start Finish Carved Explored Frontier Solution
Cells 0 / 375
Explored 0
Path length —

How it works: the generator walks a stack, knocking down walls to unvisited neighbours at random and backtracking at dead ends. The solver only ever steps through open passages — BFS guarantees the shortest route, and A* guides the same search with a Manhattan-distance heuristic.