An awesome game based on MazeRunner Trilogy!
The algorithm used in this game is Recursive Backtracker Maze Generation.
It's implementation goes like:
We start at a random cell, mark the current cell as visited, and get a list of its neighbors.
For each neighbor, starting with a randomly selected neighbor,
if that neighbor hasn't been visited, we remove the wall between this cell and that neighbor,
and then recurse with that neighbor as the current cell.
- Aakash Khanal
- Bibek Chand
- Bigyan Dahal
- Manish Gyawali
This project would have been incomplete without the contents from the sources below. Note, however we own no rights whatsover, and is only used for personal project purposes.