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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
"""
Meteor Puzzle board:
http://benchmarksgame.alioth.debian.org/u32/meteor-description.html#meteor
The Computer Language Benchmarks Game
http://benchmarksgame.alioth.debian.org/
contributed by Daniel Nanz, 2008-08-21
"""
from bisect import bisect
import pyperf
from memray_helper import get_tracker
SOLVE_ARG = 60
WIDTH, HEIGHT = 5, 10
DIR_NO = 6
S, E = WIDTH * HEIGHT, 2
SE = S + (E / 2)
SW = SE - E
W, NW, NE = -E, -SE, -SW
SOLUTIONS = [
"00001222012661126155865558633348893448934747977799",
"00001222012771127148774485464855968596835966399333",
"00001222012771127148774485494855998596835966366333",
"00001222012771127148774485994855948596835966366333",
"00001222012771127166773863384653846538445584959999",
"00001222012771127183778834833348555446554666969999",
"00001222012771127183778834833348555446554966699996",
"00001223012331123166423564455647456775887888979999",
"00001555015541144177484726877268222683336689399993",
"00001555015541144177484728677286222863338669399993",
"00001599015591159148594482224827748276837766366333",
"00001777017871184155845558449984669662932629322333",
"00004222042664426774996879687759811598315583153331",
"00004222042774427384773183331866118615586555969999",
"00004223042334423784523785771855718566186611969999",
"00004227042874428774528735833155831566316691169999",
"00004333045534455384175781777812228116286662969999",
"00004333045934459384559185991866118612286727267772",
"00004333047734427384277182221866118615586555969999",
"00004555045514411224172621768277368736683339899998",
"00004555045514411224172721777299998966836688368333",
"00004555045534413334132221177266172677886888969999",
"00004555045534473334739967792617926192661882211888",
"00004555045564466694699992288828811233317273177731",
"00004555045564466694699997773172731233312881122888",
"00004555045564496664999962288828811233317273177731",
"00004555045564496664999967773172731233312881122888",
"00004555045584411884171187722866792679236992369333",
"00004555045584411884191189999832226333267372677766",
"00004555045584411884191189999866222623336727367773",
"13335138551389511895778697869947762446624022240000",
"13777137271333211882888226999946669446554055540000",
"13777137271333211882888229999649666446554055540000",
"27776272768221681166819958195548395443954033340000",
"33322392623926696648994485554855148117871077710000",
"33366366773867284772842228449584195119551099510000",
"33366366953869584955849958447784172117721022210000",
"33366366953869589955849458447784172117721022210000",
"33386388663866989999277712727142211441554055540000",
"33396329963297629766822778117148811448554055540000",
"33399366953869586955846458447784172117721022210000",
"37776372763332622266899998119148811448554055540000",
"39999396683336822268277682748477144114551055510000",
"39999398663338622286277862748477144114551055510000",
"66777627376233362223899998119148811448554055540000",
"69999666945564455584333843887738172117721022210000",
"88811228816629162971629776993743337443554055540000",
"88822118821333213727137776999946669446554055540000",
"88822118821333213727137779999649666446554055540000",
"89999893338663786377286712627142211441554055540000",
"99777974743984439884333685556855162116621022210000",
"99995948554483564835648336837766172117721022210000",
"99996119661366513855133853782547782447824072240000",
"99996911668166581755817758732548732443324032240000",
"99996926668261182221877718757148355443554033340000",
"99996955568551681166812228177248372443774033340000",
"99996955568551681166813338137748372447724022240000",
"99996966645564455584333843887738172117721022210000",
"99996988868877627166277112223143331443554055540000",
"99997988878857765474655446532466132113321032210000",
]
def rotate(ido, rd={E: NE, NE: NW, NW: W, W: SW, SW: SE, SE: E}):
return [rd[o] for o in ido]
def flip(ido, fd={E: E, NE: SE, NW: SW, W: W, SW: NW, SE: NE}):
return [fd[o] for o in ido]
def permute(ido, r_ido, rotate=rotate, flip=flip):
ps = [ido]
for r in range(DIR_NO - 1):
ps.append(rotate(ps[-1]))
if ido == r_ido: # C2-symmetry
ps = ps[0 : DIR_NO // 2]
for pp in ps[:]:
ps.append(flip(pp))
return ps
def convert(ido):
'''incremental direction offsets -> "coordinate offsets"'''
out = [0]
for o in ido:
out.append(out[-1] + o)
return list(set(out))
def get_footprints(board, cti, pieces):
fps = [[[] for p in range(len(pieces))] for ci in range(len(board))]
for c in board:
for pi, p in enumerate(pieces):
for pp in p:
fp = frozenset([cti[c + o] for o in pp if (c + o) in cti])
if len(fp) == 5:
fps[min(fp)][pi].append(fp)
return fps
def get_senh(board, cti):
"""-> south-east neighborhood"""
se_nh = []
nh = [E, SW, SE]
for c in board:
se_nh.append(frozenset([cti[c + o] for o in nh if (c + o) in cti]))
return se_nh
def get_puzzle(width, height):
board = [E * x + S * y + (y % 2) for y in range(height) for x in range(width)]
cti = dict((board[i], i) for i in range(len(board)))
# Incremental direction offsets
idos = [
[E, E, E, SE],
[SE, SW, W, SW],
[W, W, SW, SE],
[E, E, SW, SE],
[NW, W, NW, SE, SW],
[E, E, NE, W],
[NW, NE, NE, W],
[NE, SE, E, NE],
[SE, SE, E, SE],
[E, NW, NW, NW],
]
# Restrict piece 4
perms = (permute(p, idos[3]) for p in idos)
pieces = [[convert(pp) for pp in p] for p in perms]
return (board, cti, pieces)
def solve(
n,
i_min,
free,
curr_board,
pieces_left,
solutions,
fps,
se_nh,
# Hack to use a fast local variable to avoid a global lookup
bisect=bisect,
):
fp_i_cands = fps[i_min]
for p in pieces_left:
fp_cands = fp_i_cands[p]
for fp in fp_cands:
if fp <= free:
n_curr_board = curr_board[:]
for ci in fp:
n_curr_board[ci] = p
if len(pieces_left) > 1:
n_free = free - fp
n_i_min = min(n_free)
if len(n_free & se_nh[n_i_min]) > 0:
n_pieces_left = pieces_left[:]
n_pieces_left.remove(p)
solve(
n,
n_i_min,
n_free,
n_curr_board,
n_pieces_left,
solutions,
fps,
se_nh,
)
else:
s = "".join(map(str, n_curr_board))
solutions.insert(bisect(solutions, s), s)
rs = s[::-1]
solutions.insert(bisect(solutions, rs), rs)
if len(solutions) >= n:
return
if len(solutions) >= n:
return
def bench_meteor_contest(loops, board, pieces, solve_arg, fps, se_nh):
range_it = range(loops)
with get_tracker():
t0 = pyperf.perf_counter()
for _ in range_it:
free = frozenset(range(len(board)))
curr_board = [-1] * len(board)
pieces_left = list(range(len(pieces)))
solutions = []
solve(solve_arg, 0, free, curr_board, pieces_left, solutions, fps, se_nh)
dt = pyperf.perf_counter() - t0
if solutions != SOLUTIONS:
raise ValueError("unexpected solutions")
return dt
def main():
runner = pyperf.Runner()
runner.metadata["description"] = "Solver for Meteor Puzzle board"
board, cti, pieces = get_puzzle(WIDTH, HEIGHT)
fps = get_footprints(board, cti, pieces)
se_nh = get_senh(board, cti)
solve_arg = SOLVE_ARG
runner.bench_time_func(
"meteor_contest", bench_meteor_contest, board, pieces, solve_arg, fps, se_nh
)
if __name__ == "__main__":
main()
|
