that looks interesting
Jesus, that´s really nice! Can you share how you did that?
I finally managed using one of my favourite things. Cellular Automata. It loops through the array that stores the maze. Any open cell/floor that has 3 wall neighbours
(so to the left, right, up, down)
turns into a wall. This makes it start at dead ends. It continues looping through turning open cell/floor dead ends into walls. I kind of works like a floodfill.
What you are left with is the path because if a cell/floor is part of the path it has only 2 wall neighbours the other 2 are also open cells in the path.
Sorry for the terrible explanation. If you are interested I can comment the the capx that includes the maze creator (Prims Algorithm
) and the solver (Cellular Automata). Just let me know.