A pathfinding visualizer project to generate random mazes!
In this project I have implemented a small visualization of how random mazes can be generated using a recursive depth first search. I have made this project using only python3. Starting from a random cell, the computer then selects a random neighbouring cell that has not yet been visited. The computer removes the wall between the two cells and marks the new cell as visited, and adds it to the stack to facilitate backtracking. The computer continues this process, with a cell that has no unvisited neighbours being considered a dead-end. When at a dead-end it backtracks through the path until it reaches a cell with an unvisited neighbour, continuing the path generation by visiting this new, unvisited cell (creating a new junction). This process continues until every cell has been visited, causing the computer to backtrack all the way back to the beginning cell. We can be sure every cell is visited. Pseudo code:
- Given a current cell as a parameter,
- Mark the current cell as visited
- While the current cell has any unvisited neighbour cells
- Choose one of the unvisited neighbours
- Remove the wall between the current cell and the chosen cell
- Invoke the routine recursively for a chosen cell
Just run the python script to see the visualization of a random maze using recursive depth first search.
Amijeet Thakur - amijeetthakur@gmail.com
Project Link: https://github.com/amijeet/Maze