The goal of this project is to generate mazes (in a reasonable amount of time), solve them (in a reasonable amount of time), and print the solution.

The actual algorithm I figured out is a mix of DPS (Depth-First-Search), Growing Tree and Recursive Backtracking Algorithm. I use a Li-Fo stack which stores the correct path, cell by cell. My solution approaches a O(n * log(n)) time complexity.

'Make re' at root

Generator: For a perfect generator, specify it with the word. Ignore the third argument, or put 'imperfect' for an imperfect generation.

Solver:

Hint: Remember to access the folder/generator folder to execute the binary.