This repository contains C++ implementations of various maze generation algorithms. These algorithms generate random mazes and distribute checkpoints throughout the maze. Additionally, a shortest path that passes through all the checkpoints is generated using the Held-Karp algorithm. The repository provides multiple implementations, including multithreaded and single-threaded versions of the Held-Karp algorithm, as well as a brute force algorithm for solving the maze.
To use the MGA library, follow these steps:
-
Clone the repository:
git clone https://github.com/dudynets/Maze-Generation-Algorithms.git -
Navigate to the repository directory:
cd Maze-Generation-Algorithms -
Build the project using CMake:
cmake -S . -B build -
Compile the project:
cmake --build build -
Run the executable:
cd build ./mga
Note: Make sure you have the SFML library installed on your system before building the project.
Feel free to explore the codebase and experiment with different options to generate and solve mazes!
This project was made possible thanks to the contributions of the following individuals:
A big thank you to all the contributors for their valuable input and efforts in developing the MGA project!
The Maze Generation Algorithms is released under the MIT License. Feel free to use and modify the code according to your needs. See the LICENSE file for more details.