Labyrinth-generator/algorithm.py at master · bwnuk/Labyrinth-generator · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
import time
from random import *


# algorithm


def Bot(L, x_p, y_p, R, x, y):
    """
    Function responsible for the transition of Labyrinth

    i - rows
    j - columns

    Directions:
    0-down, 1-right, 2-up, 3-left

    :param L: object Labyrinth
    :param x_p: X Start
    :param y_p: Y Start
    :param R: road
    :return: Is true when passed
    """
    i = x_p
    j = y_p

    # secure

    counter = 0

    side = 0

    while L[i][j] != 3:
        try:
            R.append([i, j])
            if side == 0:
                # dol
                if L[i + 1][j] == 1 or L[i + 1][j] == 3 or L[i + 1][j] == 4:
                    i = i + 1
                # lewo
                elif L[i][j - 1] == 1 or L[i][j - 1] == 3 or L[i][j - 1] == 4:
                    j = j - 1
                # prawo
                elif L[i][j + 1] == 1 or L[i][j + 1] == 3 or L[i][j + 1] == 4:
                    side = 1
                # gora
                elif L[i - 1][j] == 1 or L[i - 1][j] == 3 or L[i - 1][j] == 4:
                    i = i - 1
            elif side == 1:
                if L[i][j + 1] == 1 or L[i][j + 1] == 3 or L[i][j + 1] == 4:
                    j = j + 1
                elif L[i + 1][j] == 1 or L[i + 1][j] == 3 or L[i + 1][j] == 4:
                    side = 0
                elif L[i - 1][j] == 1 or L[i - 1][j] == 3 or L[i - 1][j] == 4:
                    side = 2
                elif L[i][j - 1] == 1 or L[i][j - 1] == 3 or L[i][j - 1] == 4:
                    j = j - 1
            elif side == 2:
                if L[i - 1][j] == 1 or L[i - 1][j] == 3 or L[i - 1][j] == 4:
                    i = i - 1
                elif L[i][j + 1] == 1 or L[i][j + 1] == 3 or L[i][j + 1] == 4:
                    j = j + 1
                    side = 1
                elif L[i][j - 1] == 1 or L[i][j - 1] == 3 or L[i][j - 1] == 4:
                    j = j - 1
        except:
            if side != 2:
                side = side + 1
            else:
                side = 0

        counter = counter + 1

        if counter >= 1000000:
            print("ZA DUZO")
            return False
    #print(L[i][j], i, j)
    #print(R)
    return True

# *** Generator ***
# List comprehension, algorith

def generator(my, mx):
    """
    Function responsible for generating labyrinth
    Hunt and Kill algorithm

    :param my: columns
    :param mx: rows
    :return: Labyrinth as a list
    """

    maze = [[0 for x in range(mx)] for y in range(my)]
    dx = [0, 1, 0, -1]
    dy = [-1, 0, 1, 0]  # 4 directions to move in the maze
    # start the maze from a random cell
    stack = [(randint(0, mx - 1), randint(0, my - 1))]

    while len(stack) > 0:
        (cx, cy) = stack[-1]
        maze[cy][cx] = 1
        # find a new cell to add
        nlst = []  # list of available neighbors
        for i in range(4):
            nx = cx + dx[i]
            ny = cy + dy[i]
            if 0 <= nx < mx and 0 <= ny < my:
                if maze[ny][nx] == 0:
                    # of occupied neighbors must be 1
                    ctr = 0
                    for j in range(4):
                        ex = nx + dx[j]
                        ey = ny + dy[j]
                        if 0 <= ex < mx and 0 <= ey < my:
                            if maze[ey][ex] == 1: ctr += 1
                    if ctr == 1:
                        nlst.append(i)
        # if 1 or more neighbors available then randomly select one and move
        if len(nlst) > 0:
            ir = nlst[randint(0, len(nlst) - 1)]
            cx += dx[ir]
            cy += dy[ir]
            stack.append((cx, cy))
        else:
            stack.pop()
    return maze


def pisz(L, r, k):
    for i in range(int(r)):
        for j in range(int(k)):
            print(L[i][j], end=" ")
        print(" ")
    print(" ")

# Values 0-wall, 1-road, 2-entrance, 3-exit, 4-middle