馬上注冊，結交更多好友，享用更多功能^_^

您需要 登錄 才可以下載或查看，沒有帳號？立即注冊

x

本帖最后由 wei_Y 于 2014-11-24 19:53 編輯

2008121223547917.jpg (56.62 KB, 下載次數: 3)

2014-11-17 19:22 上傳

其實木有上面那么高端啦。。只是數字版。。

規則:

迷宮沒有墻壁，但是每條邊的路被坑包圍。如果一個玩家掉在坑里的話，他們就丟失了。迷宮是用矩陣來表示(含有列表的列表): 1是坑，0的路徑的一部分。 迷宮的大小是12×12，外界都是坑。玩家在點(1,1)開始。出口是在點(10,10)。 你需要找到通過迷宮的路徑。 玩家只能通過四個方向移動 南(下 [1,0])，北(上 [-1,0])， 東(右[0,1])，西(左[0，-1])。這條路線被描述成由不同的字符組成的字符串：“S”=南，“N”=北，“E”=東，和“W”=西。復制代碼

迷宮:

One:

360截圖20141117195541691.jpg (12.09 KB, 下載次數: 0)

2014-11-17 19:55 上傳

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

[1,0,0,0,0,0,0,0,0,0,0,1],

[1,0,1,1,1,1,1,1,0,1,1,1],

[1,0,1,0,0,0,0,0,0,0,0,1],

[1,0,1,0,1,1,1,1,1,1,0,1],

[1,0,1,0,1,0,0,0,0,0,0,1],

[1,0,0,0,1,1,0,1,1,1,0,1],

[1,0,1,0,0,0,0,1,0,1,1,1],

[1,0,1,1,0,1,0,0,0,0,0,1],

[1,0,1,0,0,1,1,1,1,1,0,1],

[1,0,0,0,1,1,0,0,0,0,0,1],

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

]

Two:

360截圖20141117195840922.jpg (11.23 KB, 下載次數: 0)

2014-11-17 19:58 上傳

[

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

[1,0,1,0,0,0,1,0,0,0,0,1],

[1,0,1,0,1,0,1,0,1,1,0,1],

[1,0,1,0,1,0,1,0,1,0,0,1],

[1,0,1,0,1,0,1,0,1,0,1,1],

[1,0,1,0,1,0,1,0,1,0,0,1],

[1,0,1,0,1,0,1,0,1,1,0,1],

[1,0,1,0,1,0,1,0,1,0,0,1],

[1,0,1,0,1,0,1,0,1,0,1,1],

[1,0,1,0,1,0,1,0,1,0,0,1],

[1,0,0,0,1,0,0,0,1,1,0,1],

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

]

three:

360截圖20141117200007714.jpg (12.67 KB, 下載次數: 0)

2014-11-17 20:00 上傳

[

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

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,0,1],

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

]

Four:

360截圖20141117200155873.jpg (11.79 KB, 下載次數: 0)

2014-11-17 20:02 上傳

[

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

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,0,1],

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

]

Five:

360截圖20141117200440791.jpg (13.82 KB, 下載次數: 0)

2014-11-17 20:05 上傳

[

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

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,1,1],

[1,0,0,0,1,0,0,0,1,0,0,1],

[1,0,1,0,0,0,1,0,0,0,0,1],

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

]

測試代碼:

def check_route(func, labyrinth):

MOVE = {"S": (1, 0), "N": (-1, 0), "W": (0, -1), "E": (0, 1)}

#copy maze

route = func([row[:] for row in labyrinth])

pos = (1, 1)

goal = (10, 10)

for i, d in enumerate(route):

move = MOVE.get(d, None)

if not move:

print("Wrong symbol in route")

return False

pos = pos[0] + move[0], pos[1] + move[1]

if pos == goal:

return True

if labyrinth[pos[0]][pos[1]] == 1:

print("Player in the pit")

return False

print("Player did not reach exit")

return False復制代碼

帶上寫的函數和迷宮列表:

360截圖20141117200620783.jpg (14.2 KB, 下載次數: 0)

2014-11-17 20:06 上傳

嘻嘻，能不能寫粗來呢，各位試試吧。

我寫的太菜了不貼上來丟人了。

大神寫的:

游客，如果您要查看本帖隱藏內容請回復

總結

以上是生活随笔為你收集整理的python迷宫起点终点所有路径_通向终点的路不止一条！python迷宫。的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。