This repository contains algorithms for maze generation and various pathfinding algorithms to solve the maze. The implemented pathfinding algorithms include:
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- A* Algorithm
- Markov Decision Process (MDP) Value Iteration
- Markov Decision Process (MDP) Policy Iteration
To explore and use this project, follow these steps:
-
Clone the repository using the following command:
git clone https://github.com/Sahil3201/maze-solver
-
Change the directory to the cloned repository:
cd maze-solver
-
Install the required dependencies using the following command:
pip install -r requirements.txt
-
Create a maze with a specified side length (50) and width (150) and visualize it:
python .\maze_generator.py -l 50 -w 150
-
Run pathfinding algorithms with visualization:
python .\dfs.py -l 50 -w 100 -v Y python .\bfs.py -l 50 -w 100 -v Y python .\astar.py -l 50 -w 100 -v Y python .\MdpValueIteration.py -l 50 -w 50 -v Y python .\MdpPolicyIteration.py -l 50 -w 50 -v Y
-
For more information on each algorithm, run:
python <algo-filename> --help
Feel free to explore and contribute to the project!
Sahil Lunawat
MSc in Computer Science
Trinity College Dublin