Follow this Video Tutorial by griffpatch to learn how to make this amazing maze generator.


This project uses a programming concept called RECURSION to generate the maze. RECURSION is when a function calls itself. You can see another example of recursion in this project that makes a simple fractal tree.

Taking it further – Are you ready for a challenge?

Once you have completed the maze generator project, can you program a path finder that can automatically complete the maze? There are many ways you could do it. One approach could be to use a list to keep track of all the turns your path finder makes. Then if you come to a dead end you can use the information in your list to get back to the last place that you had a choice to make. From there you would choose a different path.