Maze.py

from random import randint
import numpy as np

def creat_map(start_node,end_node,mazeX,mazeY,sparsity):
    # Set the size of the maze.
    # These must be odd integers of 7 or above.
    xSize = mazeX
    ySize = mazeY

    # Set the maximum wall length.  This avoids overly long
    # walls on larger mazes.
    # The smaller the value, the greater possible solutions.
    maxWall = 13

    # Create a list to store the maze data.
    # 0 denotes a walkway, 1 is a wall, start with no walls.
    maze = (xSize*ySize)*[0]

    # Set every other cell to 2, these are the starting points.
    for i in range(0,xSize,sparsity):
        for j in range(0,ySize,sparsity):
            
            maze[(j*xSize)+i]=2

    # Create a wall around the maze.
    # Top and bottom.
    for i in range(0,xSize):
        maze[i]=1
        maze[(xSize*(ySize-1))+i] = 1
    # Left and right.
    for i in range(1,ySize-1):
        maze[xSize*i]=1
        maze[(xSize*i)+(xSize-1)] = 1

    # Create the maze.
    while 2 in maze:

        # Pick a random starting point.
        x = randint(1,(xSize-1)/2)*2
        y = randint(1,(ySize-1)/2)*2
        c = maze[(y*xSize)+x]

       

        # If the point hasn't already been used pick a random direction
        # and move that way until we hit a wall.
        if c == 2:
            mwc = 0
            r = randint(0,3)
            if r == 0:
                while c != 1:
                    maze[(y*xSize)+x] = 1
                    y -= 1
                    c = maze[(y*xSize)+x]
                    mwc += 1
                    if mwc == maxWall: break
            if r == 1:
                while c != 1:
                    maze[(y*xSize)+x] = 1
                    x += 1
                    c = maze[(y*xSize)+x]
                    mwc += 1
                    if mwc == maxWall: break
            if r == 2:
                while c != 1:
                    maze[(y*xSize)+x] = 1
                    y += 1
                    c = maze[(y*xSize)+x]
                    mwc += 1
                    if mwc == maxWall: break
            if r == 3:
                while c!= 1:
                    maze[(y*xSize)+x] = 1
                    x -= 1
                    c = maze[(y*xSize)+x]
                    mwc += 1
                    if mwc == maxWall: break

    maze_map={}
    arr=np.ones((xSize,ySize))
    for i in range(0,ySize): 
        for j in range(0,xSize):
            k = maze[(i*xSize)+j]
            if k == 1:
                if (i==start_node[0]  and j==start_node[1]) or (j==end_node[1]and i==end_node[0]):
                    continue
                else:
                    maze_map[(i,j)]=1
                    arr[j][i]=0
            
    return maze_map,arr