0

我正在研究迷宫解决方案问题。代码找到目标后，我无法让python打印出解决方案列表。但它是家庭作业所必需的。

有人可以帮助我吗？我刚学了 3 周的 Python。我想打印出 python 走向最终目标的每一步。这是我的代码：

def mazeDetector(row,col):
    c= m[row][col]
    solution=[]

    if c =="W":
        print "Wall here: "+ str(row)+ ","+ str(col)
        return False
    elif c =="V":
        print "Visited: " + str(row)+ ","+ str(col)
        return False
    elif c=="F":
        print "Found: "+ str(row)+ ","+ str(col)
        print solution
        return True

    print "visiting:"+ str(row)+ ","+ str(col) 
    solution.append((row,col),)
    m[row][col]=="V"
    if (col>0 and mazeDetector(row,col-1)):
        return True
    elif (row< len(m)-1 and mazeDetector(row+1,col)):
        return True
    elif (row>0 and mazeDetector(row-1, col)):
        return True
    elif (col<=len(m)-1 and mazeDetector(row, col+1)):
        return True
    return False
mazeDetector(1,5)

这里是迷宫，W意思是墙，P意思是要去的地方，S意思是开始，F意思是最终：

[['W', 'P', 'P', 'W', 'W', 'W'], 
 ['W', 'W', 'P', 'W', 'P', 'S'], 
 ['W', 'W', 'P', 'W', 'P', 'W'], 
 ['P', 'P', 'P', 'P', 'P', 'W'], 
 ['F', 'W', 'P', 'W', 'W', 'W'], 
 ['W', 'P', 'P', 'P', 'P', 'W']]
4

2 回答 2

1

您必须将解决方案传递给您的函数，而不是每次都创建它：

def mazeDetector(row,col, solution):
    c= m[row][col]
    solution.append((row, col))
    if c =="W":
        print "Wall here: "+ str(row)+ ","+ str(col)
        return False
    elif c =="V":
        print "Visited: " + str(row)+ ","+ str(col)
        return False
    elif c=="F":
        print "Found: "+ str(row)+ ","+ str(col)
        print solution
        return True

    print "visiting:"+ str(row)+ ","+ str(col) 
    m[row][col]=="V"
    if (col>0 and mazeDetector(row,col-1, list(solution))):
        return True
    elif (row< len(m)-1 and mazeDetector(row+1,col, list(solution))):
        return True
    elif (row>0 and mazeDetector(row-1, col, list(solution))):
        return True
    elif (col<=len(m)-1 and mazeDetector(row, col+1, list(solution))):
        return True
    return False
mazeDetector(1,5, [])

这是返回路径（如果存在）的代码

def mazeDetector(row, col, solution):
    solution.append((row, col))
    if m[row][col] == "F": return True, solution
    m[row][col] = "V"
    neighbors = [(row, col - 1), (row + 1, col), (row - 1, col), (row, col + 1)]
    neighbors = filter(lambda (r, c): r >= 0 and c >= 0 and r < len(m) and c < len(m) and m[r][c] not in ("V", "W"), neighbors)
    for r, c in neighbors:
        t, sol = mazeDetector(r, c, list(solution))
        if t: return True, sol
    return False, []

print mazeDetector(1, 5, [])[1]
于 2013-07-21T19:47:20.120 回答
0

你可以简单地用另一个符号替换你实际解决的路线上的“P”，可能是“g”，这样就可以了！

于 2013-07-21T19:44:34.397 回答