开发者

Python利用Prim算法生成迷宫

开发者 https://www.devze.com 2023-01-07 09:39 出处:网络 作者: Leleprogrammer
Prim算法随机生成后的迷宫数列矩阵如下图: 15x15: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 0 1 0 1 0 1 1 1 1 1 0 1 0 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 1 0 0 0 1

Prim算法随机生成后的迷宫数列矩阵如下图:

15x15:

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 

0 s 0 1 0 1 0 1 1 1 1 1 0 1 0 

0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 

0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 

0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 

0 1 0 1 1 1 0 1 1 1 0 1 0 1 0 

0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 

0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 

0 1 0 1 0 0 0 1 0 0 0 1 0 0 0 

0 1 0 1 0 1 1 1 0 1 1 1 1 1 0 

0 1 0 1 0 0 0 1 0 0 0 1 0 1 0 

0 1 0 1 0 1 1 1 1 1 0 1 0 1 0 

0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 

0 1 1 1 0 1 1 1 1 1 1 e 0 1 0 

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 

27x27:

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 

0 s 1 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 0 

0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 

0 1 1 1 0 1 0 1 1 1 0 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 0 

0 0 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 

0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 0 1 1 1 0 

0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 

0 1 0 1 0 1 0 1 0 1 1 1 0 1 1 1 0 1 0 1 编程0 1 0 1 1 1 0 

0 0 0 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 

0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 

0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 

0 1 0 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 1开发者_Go学习 0 1 0 

0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 

0 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 

0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0android 1 0 1 0 

0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 

0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 

0 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 

0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 

0 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 0 

0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 

0 1 1 1 1 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 

0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 

0 1 0 1 0 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 0 

0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 0 0 

0 1 1 1 e 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 0 

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 

实现该效果的代码如下: 

import random as rd
 
nearmaybe=[
    [-2,0],
    [2,0],
    [0,-2],
    [0,2]
]
 
def createMaze(row,col):
    maze=[[0 for i in range(col)] for i in range(row)]
    check=[]
    firstrow=rd.randrange(1,row-2,2)
    firstcol=rd.randrange(1,col-2,2)
    maze[firstrow][firstcol]=1
    check.append([firstrow,firstcol])
    while len(check):
        c=rd.choice(check)
        nears=[]
        conditions=[]
        for maybe in nearmaybe:
            conditions.append([c[0]+maybe[0],c[1]+maybe[1]])
        for condition in conditions:
            if conandroiddition[0]>=1 and condition[0]<=row-2 \
                    and condition[1]>=1 and condition[1]<=col-2:
                nears.append([condition[0],condition[1]])
        for n in nears.copy():
            if maze[n[0]][n[1]]:
                nears.remove(n)
        for block in nears:
            if block[0]==c[0]:
                if block[1]<c[1]:
                    maze[block[0]][c[1]-1]=1
                    maze[block[0]][block[1]]=1
                    check.append([block[0],block[1]])
                else:
                    maze[block[0]][block[1]-1]=1
                    maze[block[0]][block[1]]=1
                    check.append([block[0],block[1]])
            else:
                if block[0]<c[0]:
                    maze[c[0]-1][block[1]]=1
                    maze[block[0]][block[1]]=1
                    check.append([block[0],block[1]])
                else:
                    maze[block[0]-1][block[1]]=1
                    maze[block[0]][block[1]]=1
                    check.append([block[0],block[1]])
        if not len(nears):
            check.remove(c)
    maze[1][1]="s"
    while True:
        c=rvJpvyyxyMvd.randint(1,col-2)
        if maze[row-2][c]:
            maze[row-2][c]="e"
            break
 
    return maze

调用该函数的方法:

maze=createMaze(27,27)
for l in maze:
    for s phpin l:
        print(s,end=" ")
    print()

CreateMaze传入的两个参数必须都是单数,否则程序可能会无法运行!

下面的for循环遍历就是将生成的迷宫矩阵打印出来

S表示出发点

1表示路

0表示墙

E表示终点

生成迷宫矩阵后,就可以将其引用到游戏中去啦!

到此这篇关于python利用Prim算法生成迷宫的文章就介绍到这了,更多相关Python Prim生成迷宫内容请搜索我们以前的文章或继续浏览下面的相关文章希望大家以后多多支持我们!

0

精彩评论

暂无评论...
验证码 换一张
取 消