The problem is that you’re not ensuring that the steps in your walk are valid. The way you have it currently, walk could pick a neighboor that is out of the bounds of the maze. For example, if a maze is 5×5, attempting to access maze[5][?] or maze[?][5] will result in an IndexError like you … Read more
I think the algorithms you linked will work if you expand each cell into 4 cells, and use the top, left and top left as the walls if they exist. Walls below the cell will be handle as a wall above the cell below, if that makes sense? solved Generating a perfect maze in C
Let Px be the probability that the game ends in position 3 if it starts in position x. We know that P3=1 and P7=0 If you start in any other cell, then after you move you are essentially beginning the game again in the new cell. The probabilities for the other 7 cells can therefore … Read more