← Back

🏰 Labyrinth Escape

Maze Solver - DFS Backtracking

Position

-

Steps

0

Visited

0

Backtracks

0

Path Length

0
Start
End
Wall
Visited
Current
Generate a maze and find the path!

πŸ“– Maze Solving (DFS)

Backtracking: Try each direction from current cell

β€’ If valid and unvisited, move there

β€’ If stuck, backtrack to previous cell

β€’ Continue until end reached or all paths exhausted

Directions: Down, Right, Up, Left