https://github.com/musadiqpasha/maze-generator-and-solver
This project generates a random maze of a given size and provides a solution using Dijkstra's algorithm or allows the user to manually solve it.
https://github.com/musadiqpasha/maze-generator-and-solver
dijkstra-algorithm maze-generator maze-solver processing processing3 python3
Last synced: 26 days ago
JSON representation
This project generates a random maze of a given size and provides a solution using Dijkstra's algorithm or allows the user to manually solve it.
- Host: GitHub
- URL: https://github.com/musadiqpasha/maze-generator-and-solver
- Owner: MusadiqPasha
- License: mit
- Created: 2025-01-13T23:16:36.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-01-13T23:44:55.000Z (over 1 year ago)
- Last Synced: 2025-03-14T02:12:05.787Z (about 1 year ago)
- Topics: dijkstra-algorithm, maze-generator, maze-solver, processing, processing3, python3
- Language: Python
- Homepage:
- Size: 7.2 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Maze-Generator-and-Solver
This project generates random mazes and solves them using Dijkstra's algorithm to find the shortest path. It features an interactive interface allowing both auto-solve and manual navigation of the maze.
## Features
- **Random Maze Generation**: Generates a random maze using a backtracking algorithm.
- **Maze Solver**: Solves the maze using Dijkstra's algorithm.
- **Interactive Navigation**: Allows the user to manually navigate the maze using WASD keys.
- **Auto-Solve Option**: Option to automatically solve the maze, with the solution path being visually displayed.
- **Adjustable Maze Size**: The size of the maze can be modified dynamically using an input box.
- **Elapsed Time Display**: Displays the elapsed time for the auto-solve feature.
## How It Works
### Maze Generation and Solving
- The maze is generated using a backtracking algorithm.
- Starting from the top-left corner, it recursively explores neighboring cells, carving paths (-1) and marking walls (-2).
- The algorithm backtracks when no unvisited neighbors remain, ensuring a perfect maze with one solution.
### Maze Solving:
- Dijkstra's algorithm is used to find the shortest path from the start to the end.
- It explores neighboring cells, updating the shortest path cost, and reconstructs the solution path once the end is reached.
- The path is then marked on the maze (2).
### Visualization:
- During the maze generation, the walls (-2) are drawn as black squares, while the open paths (-1) are displayed as white squares.
- The start point is typically highlighted as a red square (1).
- The path solution is displayed as purple squares (2) during the auto-solve process.
## Demo
### Dijkstra's algorithm
### User
## Usage
**Generate Maze:** Click the "Generate Maze" button to create a new random maze.
**Manual Solve:** Use the WASD keys to navigate through the maze. Avoid walls (black cells).
**Auto Solve: **Click the "Auto-Solve" button to solve the maze automatically using Dijkstra's algorithm.
**Adjust Maze Size:** Click on the Maze Size button , then enter a new maze size in the input box (default: 50x50) and press Enter to update the maze and move the cursor out of the Maze Size box and click it.
## Installation
1. Download and install [Processing](https://processing.org/) [use Python Mode]
2. Clone this repository or download the ZIP file:
```bash
git clone https://github.com/kmusadiqpasha/maze-generator-and-solver
3. Open the .pde files for each simulation in Processing.
4. Run the sketches and watch the maze come to life!
### License
- This project is licensed under the MIT License - see the LICENSE file for details.
##
## Just follow me and Star ⭐ my repository
## Thank You!!