#Maze
1 messages · Page 1 of 1 (latest)
So in essence we're saying a 9 cell maze and your solution is intended to make sure that a solution is possible, otherwise you would attempt a re-generation?
It might make sense to consider first generating the solution, then backtracking any empty slot in your shape and determining whether you'll fill it up with a random set of dead ends or not.
That would guarantee a solution exists by nature of having started out with one, and also gives you a degree of control as to how complicated you'd want the maze to be.
Visualized randomized depth-first search algorithm for maze generation.
Solve maze by searching all possible routes.
Display possible solutions.
Music by Jeroen Tel - The Open Soul.
This is my point of reference
Although I wanna start with something simple to get used with using lists since i'm new to those
I have already generated a maze and I would suggest you to use Hunt and Kill Algorithm. I found it to be easier than Recursive Backtracker >>> https://weblog.jamisbuck.org/2011/1/24/maze-generation-hunt-and-kill-algorithm