-
Notifications
You must be signed in to change notification settings - Fork 0
/
find_path.py
182 lines (154 loc) · 4.24 KB
/
find_path.py
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
169
170
171
172
173
174
175
176
177
178
179
180
181
#0 - up
#1 - right
#2 - down
#3 - left
#0 - free
#1 - go to
#2 - went from
#3 - occupied
def find_path(tab, p, x, y):
step=0
direction = 0
n = len(tab)
while(True):
#end condition
suma = 0
break_me = False
for j in range(n):
if break_me:
break;
for i in range(n):
if x == i and y == j:
continue
if tab[j][i] == 0 and temp_tab[j][i] == 0:
break_me = True
break
if not break_me:
print "Success"
print_path(p)
return
if direction == 0:
if y - 1 >= 0:
if tab[y-1][x] == 0 and temp_tab[y-1][x] == 0 and p[step][direction] == 0:#up free
print 'Go x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 1
p[step+1][2] = 2
temp_tab[y][x] = 1
step = step + 1
direction = 0
y = y - 1
else:
print 'Field occupied x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][0] = 3
direction = direction + 1
else:
print 'Out of table x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 3
direction = direction + 1
elif direction == 1:
if x + 1 < n:
if tab[y][x+1] == 0 and temp_tab[y][x+1] == 0 and p[step][direction] == 0:#right free
print 'Go x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 1
p[step+1][3] = 2
temp_tab[y][x] = 1
step = step + 1
direction = 0
x = x + 1
else:
print 'Field occupied x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][1] = 3
direction = direction + 1
else:
print 'Out of table x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 3
direction = direction + 1
elif direction == 2:
if y + 1 < n:
if tab[y+1][x] == 0 and temp_tab[y+1][x] == 0 and p[step][direction] == 0:#down free
print 'Go x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 1
p[step+1][0] = 2
temp_tab[y][x] = 1
step = step + 1
direction = 0
y = y + 1
else:
print 'Field occupied x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][1] = 3
direction = direction + 1
else:
print 'Out of table x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 3
direction = direction + 1
elif direction == 3:
if x - 1 >= 0:
if tab[y][x-1] == 0 and temp_tab[y][x-1] == 0 and p[step][direction] == 0:#left free
print 'Go x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
p[step][direction] = 1
p[step+1][1] = 2
temp_tab[y][x] = 1
step = step + 1
direction = 0
x = x - 1
else:
print 'Field occupied x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
if step == 0:
print "Impossible!"
return;
#go back!
x, y, step, direction = step_back(x,y,step)
else:
print 'Out of table x=%s, y=%s, direction=%s, step=%s' % (x, y, direction, step)
if step == 0:
print "Impossible!"
return;
#go back
x, y, step, direction = step_back(x,y,step)
def step_back(x,y,step):
p[step][0] = 0
p[step][1] = 0
p[step][2] = 0
p[step][3] = 0
x,y = clear_prev(x,y,step)
step = step - 1
direction = 0
return x, y, step, direction
def clear_prev(x,y,step):
if p[step-1][0] == 1: #up
temp_tab[y+1][x] = 0
p[step-1][0] = 3
y = y + 1
elif p[step-1][1] == 1: #rigt
temp_tab[y][x-1] = 0
p[step-1][1] = 3
x = x - 1
elif p[step-1][2] == 1: #down
temp_tab[y-1][x] = 0
p[step-1][2] = 3
y = y - 1
elif p[step-1][3] == 1:#left
temp_tab[y][x+1] = 0
p[step-1][3] = 3
x = x + 1
return x,y
def print_path(p):
for i in p:
if i[0] == 1:
print "up"
if i[1] == 1:
print "right"
if i[2] == 1:
print "down"
if i[3] == 1:
print "left"
if __name__ == "__main__":
tab = [[0,0,0,0],
[0,0,1,0],
[0,0,1,1],
[0,0,1,1]]
temp_tab = [list((0,)*len(tab[0])) for i in range(len(tab))]
p = [list((0,)*4) for i in range(len(tab)*len(tab[0]))]
x = 0
y = 0
find_path(tab, p, x, y)