1 Star 0 Fork 0

dzc/Python-1

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
rook.py 1.28 KB
一键复制 编辑 原始数据 按行查看 历史
start = [0,0]
end = [7,7]
taken = [
[1,0], [1,1], [1,2], [1,3]
]
queue = []
queue.append([start[0],start[1],-1])
visited = []
maze = []
for i in range(8):
maze.append(['.','.','.','.','.','.','.','.'])
visited.append([0,0,0,0,0,0,0,0])
maze[start[0]][start[1]] = 'S'
maze[end[0]][end[1]] = 'E'
for i in taken:
maze[i[0]][i[1]] = 'X'
while(len(queue) > 0):
point = queue.pop(0)
if end[0] == point[0] and end[1] == point[1]:
print(point[2] + 1)
break
current = point[2] + 1
if point not in taken and visited[point[0]][point[1]]==0:
visited[point[0]][point[1]] = current
for i in range(point[0], -1, -1):
if [i,point[1]] in taken:
break
if visited[i][point[1]]==0:
queue.append([i,point[1],current])
for i in range(point[0], 8):
if [i,point[1]] in taken:
break
if visited[i][point[1]]==0:
queue.append([i,point[1],current])
for i in range(point[1], -1, -1):
if [point[0],i] in taken:
break
if visited[point[0]][i]==0:
queue.append([point[0],i,current])
for i in range(point[1], 8):
if [point[0],i] in taken:
break
if visited[point[0]][i]==0:
queue.append([point[0],i,current])
for i in maze:
for j in i:
print(j, end=' ')
print()
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/sdredboy/Python-1.git
git@gitee.com:sdredboy/Python-1.git
sdredboy
Python-1
Python-1
master

搜索帮助