python迷宫算法及实现_Python迷宫递归算法

所以我盯着这个有一段时间了，我不知道怎么才能回到这个迷宫的正确路径。在

2代表墙MAZE = [[2,2,2,2,1,2],

[2,2,1,2,1,2],

[2,2,1,2,1,2],

[2,1,1,1,1,2],

[2,1,2,2,2,2],

[2,1,2,2,2,2]]

START_ROW = 5

START_COL = 1

END_ROW = 0

END_COL = 4

was_here = [[False]*6 for i in range(6)]

correct_path = [[False]*6 for i in range(6)]

def recursiveSolve(x, y, correct_path):

if x == END_ROW and y == END_COL:

print correct_path

return True

if MAZE[x][y] == 2 or was_here[x][y]:

return False

was_here[x][y] = True

if x != 0:

if recursiveSolve(x-1, y, correct_path):

correct_path[x][y] = True

return True

if x != 5:

if recursiveSolve(x+1, y, correct_path):

correct_path[x][y] = True

return True

if y != 0:

if recursiveSolve(x, y-1, correct_path):

correct_path[x][y] = True

return True

if y != 5:

if recursiveSolve(x, y+1, correct_path):

correct_path[x][y] = True

return True

return False

print recursiveSolve(START_ROW, START_COL, correct_path)

我的代码很好用。它告诉你迷宫是否可解，但我不能打印出一个数组来显示这个迷宫。如果迷宫是可解的，我想打印出一个如下所示的数组：

^{pr2}$

但我的密码打印出来都是假的。在