• Introduction
• Frameworks
• How to use
• Showcase

A simple maze generator using Recursive backtracker methods. This project has been written as a part of university project.

Essentially, the program starts at cell X: 0, Y: 0 and marks the cell as visited. It then checks all the neighbours and whether they were visited before. It randomly chooses of the neighbours and automatically removes the wall between them. The methods is then recursively called for a chosen cell.

• Java
• Processing IDE

1. Downlad Processing onto your system.
2. Fork this repository into the directory on your system.
3. Open the project using Processing.
4. Click the start button in top-right corner of Processing IDE.

1. Generation of the maze

2. Finished maze