-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathold
168 lines (157 loc) · 4.95 KB
/
old
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
'''
j = 0
i = 0
while (j <= w-1):
while (i <= h-1):
print "Check position [" + str(j) + ", " + str(i) + "] : " + str(Maze[j][i])
print str(doespathexist(Maze,j,i,w,h,end)) + '\n'
i = i+1
j = j+1
'''
'''
j = 0
i = 0
for j in range(h):
for i in range(w):
Maze[j][i] = get_element(Maze,j,i,w,h,end)
i = i + 1
j = j + 1
'''
'''
def try_random_edge(Maze,j,i,w,h,end):
if(j == 0):
if (i = 0):
return try_rand_edge(Maze,j,i,w,h,end,[2,3])
elif (i == w-1):
return try_rand_edge(Maze,j,i,w,h,end,[0,2])
else:
return try_rand_edge(Maze,j,i,w,h,end,[0,2,3])
elif (j == h-1):
if (i = 0):
return try_rand_edge(Maze,j,i,w,h,end,[1,3])
elif (i == w-1):
return try_rand_edge(Maze,j,i,w,h,end,[0,1])
else:
return try_rand_edge(Maze,j,i,w,h,end,[0,1,3])
else:
if (i = 0):
return try_rand_edge(Maze,j,i,w,h,end,[1,2,3])
elif (i == w-1):
return try_rand_edge(Maze,j,i,w,h,end,[0,1,2])
else:
return try_rand_edge(Maze,j,i,w,h,end,[0,1,2,3])
'''
'''
def get_element(Maze,j,i,w,h,end):
return [getrandtop(Maze,j,i,end),
getrandleft(Maze,j,i,end),
getrandright(Maze,j,i,w,end),
getrandbottom(Maze,j,i,h,end)]
def getrandtop(Maze,j,i,end):
if(end == [j,i]):
return 0
else:
if(j == 0):
return 1
else:
if(Maze[j-1][i][3] == 1):
return 1
else:
return random.randint(0, 1)
def getrandbottom(Maze,j,i,h,end):
if(end == [j,i]):
return 0
else:
if(j == h-1):
return 1
else:
return random.randint(0, 1)
def getrandleft(Maze,j,i,end):
if(end == [j,i]):
return 0
else:
if(i == 0):
return 1
else:
return random.randint(0, 1)
def getrandright(Maze,j,i,w,end):
if(end == [j,i]):
return 0
else:
if(i >= w-1):
return 1
else:
return random.randint(0, 1)
def doespathexist(Maze,j,i,w,h,end):
c = 0
last = None
pos = [j,i]
while(end != pos):
if (pos == None):
return False
elif(c > (w*h)):
return False
j = pos[0]
i = pos[1]
pos = move(Maze,j,i,w,h,set([0,1,2,3]),last,end)
last = [j,i]
if(pos != None):
continue
#print "moved [" + str(last[0]) + ", " + str(last[1]) + "] --> [" + str(pos[0]) + ", " + str(pos[1]) + "]"
else:
return False
c = c+1
return True
def move(Maze,j_curr,i_curr,w,h,rem,last,end):
if(len(rem) == 0):
return None
elif(len(rem) == 1):
dir = random.randint(0, len(rem) - 1)
if(dir == 0):
if (Maze[j_curr][i_curr][0] == 1):
return None
elif(dir == 1):
if (Maze[j_curr][i_curr][1] == 1):
return None
elif(dir == 2):
if (Maze[j_curr][i_curr][2] == 1):
return None
else:
if (Maze[j_curr][i_curr][3] == 1):
return None
else:
dir = random.randint(0, len(rem) - 1)
rem_array = np.array([item for item in rem])
if(rem_array[dir] == 0):
if ((Maze[j_curr][i_curr][0] == 0) & (j_curr-1 >= 0)):
if (last == [j_curr-1,i_curr]):
return move(Maze,j_curr,i_curr,w,h,rem.difference([0]),last,end)
else:
return [j_curr-1,i_curr]
else:
return move(Maze,j_curr,i_curr,w,h,rem.difference([0]),last,end)
elif(rem_array[dir] == 1):
if ((Maze[j_curr][i_curr][1] == 0) & (i_curr-1 >= 0)):
if (last == [j_curr,i_curr-1]):
return move(Maze,j_curr,i_curr,w,h,rem.difference([1]),last,end)
else:
return [j_curr,i_curr-1]
else:
return move(Maze,j_curr,i_curr,w,h,rem.difference([1]),last,end)
elif(rem_array[dir] == 2):
if ((Maze[j_curr][i_curr][2] == 0) & (i_curr+1 <= w-1)):
if(last == [j_curr,i_curr+1]):
return move(Maze,j_curr,i_curr,w,h,rem.difference([2]),last,end)
else:
return [j_curr,i_curr+1]
else:
return move(Maze,j_curr,i_curr,w,h,rem.difference([2]),last,end)
else:
if ((Maze[j_curr][i_curr][3] == 0) & (j_curr+1 <= h-1)):
if (last == [j_curr+1,i_curr]):
return move(Maze,j_curr,i_curr,w,h,rem.difference([3]),last,end)
else:
return [j_curr+1,i_curr]
else:
return move(Maze,j_curr,i_curr,w,h,rem.difference([3]),last,end)
'''