-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathfindpath.py
220 lines (215 loc) · 12.2 KB
/
findpath.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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
from timeit import Timer
def find_path(stat,operate='me_to_home',pathstat=None,pathmark=None,outputmark='mypath'):
'''
寻路函数，寻找me/enemy到达各自领地，对方纸带，或给定路径的长度和路径
传入参数：
stat
operate 字符串 默认me_to_home，支持me_to_home, me_to_path, enemy_to_home, enemy_to_path
pathstat 二维数组 默认None,自定义的路径信息，配合_to_path两operate使用
pathmark 字符串 默认None,自定义路径信息中的路径标记
outputmark 字符串 默认mypath,输出路径信息中的路径标记
返回：
outputpath 二维数组
distance 字符串 路径长度
版本：
1.0： 童培峰
存在问题：
出现同样distance的不同路径时如何寻找最优解
'''
if operate == 'me_to_home':
myid = stat['now']['me']['id']
myx = stat['now']['me']['x']
myy = stat['now']['me']['y']
statlist = stat['now']['fields']
fieldid = myid
elif operate == 'enemy_to_home':
myid = stat['now']['enemy']['id']
myx = stat['now']['enemy']['x']
myy = stat['now']['enemy']['y']
statlist = stat['now']['fields']
fieldid = myid
elif operate == 'me_to_path':
myid = stat['now']['me']['id']
myx = stat['now']['me']['x']
myy = stat['now']['me']['y']
if not pathstat:
statlist = stat['now']['bands']
fieldid = stat['now']['enemy']['id']
else:
statlist = pathstat
fieldid = pathmark
elif operate == 'enemy_to_path':
myid = stat['now']['enemy']['id']
myx = stat['now']['enemy']['x']
myy = stat['now']['enemy']['y']
if not pathstat:
statlist = stat['now']['bands']
fieldid = stat['now']['me']['id']
else:
statlist = pathstat
fieldid = pathmark
outputpath = []
col_length = len(stat['now']['fields'])#可以用storage里的size替代
row_length = len(stat['now']['fields'][0])
distance = col_length + row_length
finalpath = []
for x in range(col_length):
outputpath.append([])
for y in range(row_length):
outputpath[x].append(None)
#判断是不是领地范围
if statlist[x][y] == fieldid:
temp_distance = abs(x-myx) + abs(y-myy)#计算最短路径距离
#判断距离是否更小
if temp_distance <= distance:
#分四象限考虑
if x <= myx and y <= myy:#第二象限
#是不是边缘点
if statlist[x+1][y] != fieldid and statlist[x][y+1] != fieldid:#角落
path1 = [(outputmark,i,y) for i in range(x,myx) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(y,myy) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
else:
path1 = [(outputmark,x,j) for j in range(y,myy) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(x,myx) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x+1][y] != fieldid:#同上一
path1 = [(outputmark,i,y) for i in range(x,myx) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(y,myy) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x][y+1] != fieldid:#同上二
path1 = [(outputmark,x,j) for j in range(y,myy) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(x,myx) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif x > myx and y <= myy:#第一象限
if statlist[x-1][y] != fieldid and statlist[x][y+1] != fieldid:#角落
path1 = [(outputmark,i,y) for i in range(myx+1,x+1) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(y,myy) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
else:
path1 = [(outputmark,x,j) for j in range(y,myy) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(myx+1,x+1) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x-1][y] != fieldid:
path1 = [(outputmark,i,y) for i in range(myx+1,x+1) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(y,myy) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x][y+1] != fieldid:
path1 = [(outputmark,x,j) for j in range(y,myy) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(myx+1,x+1) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif x <= myx and y > myy:#第三象限
if statlist[x+1][y] != fieldid and statlist[x][y-1] != fieldid:#角落
path1 = [(outputmark,i,y) for i in range(x,myx) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(myy+1,y+1) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
else:
path1 = [(outputmark,x,j) for j in range(myy+1,y+1) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(x,myx) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x+1][y] != fieldid:#同上一
path1 = [(outputmark,i,y) for i in range(x,myx) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(myy+1,y+1) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x][y-1] != fieldid:#同上二
path1 = [(outputmark,x,j) for j in range(myy+1,y+1) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(x,myx) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
else:#第四象限
if statlist[x-1][y] != fieldid and statlist[x][y-1] != fieldid:#角落
path1 = [(outputmark,i,y) for i in range(myx+1,x+1) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(myy+1,y+1) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
else:
path1 = [(outputmark,x,j) for j in range(myy+1,y+1) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(myx+1,x+1) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x-1][y] != fieldid:
path1 = [(outputmark,i,y) for i in range(myx+1,x+1) if stat['now']['bands'][i][y]!=myid]
path2 = [(outputmark,myx,j) for j in range(myy+1,y+1) if stat['now']['bands'][myx][j]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
elif statlist[x][y-1] != fieldid:
path1 = [(outputmark,x,j) for j in range(myy+1,y+1) if stat['now']['bands'][x][j]!=myid]
path2 = [(outputmark,i,myy) for i in range(myx+1,x+1) if stat['now']['bands'][i][myy]!=myid]
path = path1 + path2
if len(path) == temp_distance:
distance = temp_distance
finalpath = path
for item in finalpath:
outputpath[item[1]][item[2]]=item[0]
return outputpath, distance
if __name__=='__main__':
stat={}
stat['now'] = {}
me={}
stat['now']['me']=me
stat['now']['me']['id'] = 1
stat['now']['me']['x'] = 3
stat['now']['me']['y'] = 3
enemy={}
stat['now']['enemy']=enemy
stat['now']['enemy']['id']=2
stat['now']['enemy']['x']=2
stat['now']['enemy']['y']=2
fieldlist = [[1 for j in range(101)] for i in range(101)]
#stat['now']['fields'] = fieldlist
stat['now']['fields'] = [
[0,0,0,0,0,0],
[0,0,1,0,0,0],
[0,0,0,0,0,0],
[0,0,0,'me',0,0],
[1,0,0,0,0,0]]
stat['now']['bands'] = [[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,1,0,2,0,0],[0,1,1,1,0,0]]
# for i in range(10):
finalpath, distance = find_path(stat,'me_to_home')
t1 = Timer("find_path(stat,'me_to_home')","from __main__ import find_path,stat")
print(t1.timeit(number=1))
print(distance)
for i in finalpath:
print(i)
#print(finalpath)