Generation Algorithm
DFS with backtracking. Creates long winding corridors with few branches.
Solve Algorithm
Optimal pathfinding with Manhattan distance heuristic.
Size
25
25
Stats
Cells: 0 | Walls: 0
Steps: 0 | Path: 0
Steps: 0 | Path: 0
Log