-
Notifications
You must be signed in to change notification settings - Fork 0
/
board.hpp
313 lines (271 loc) · 15 KB
/
board.hpp
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
#pragma once
/**
* bitboard
*
* 座標系:
* 01234567
* 89ABCDEF
* ...
*/
#include <bits/stdc++.h>
#include <x86intrin.h>
#include "common.hpp"
using namespace std;
inline string bitboard_str(u64 bb) {
ostringstream out;
REP(i, 64) {
out << ((bb&(1ULL<<i)) ? '1' : '0');
if(i%8 == 7) out << '\n';
}
return out.str();
}
// bb != 0 を仮定
inline int bitboard_bsf(u64 bb) noexcept {
return __builtin_ctzll(bb);
}
// 上下左右いずれかに隣接する1があれば1
inline u64 bitboard_neighbor(u64 bb) noexcept {
return ((bb&0x7F7F7F7F'7F7F7F7F)<<1) |
((bb&0xFEFEFEFE'FEFEFEFE)>>1) |
(bb<<8) | (bb>>8);
}
// seed から到達できる領域を返す(境界含む)
inline u64 bitboard_floodfill(u64 bb, u64 seed) noexcept {
u64 cur = seed & (seed ^ bb);
for(;;) {
u64 tmp = cur | bitboard_neighbor(cur);
u64 nex = tmp & (tmp ^ bb);
if(cur == nex)
return tmp | seed;
cur = nex;
}
}
enum Tile {
TL_U = 0,
TL_D,
TL_L,
TL_R,
TL_WALL,
TL_PC0, TL_PC1, TL_PC2, TL_PC3, TL_PC4, TL_PC5, TL_PC6, TL_PC7, TL_PC8,
TL_FIRST = 0,
TL_LAST = 14,
TL_COUNT = TL_LAST - TL_FIRST,
TL_DIR_FIRST = 0,
TL_DIR_LAST = 4,
TL_DIR_COUNT = TL_DIR_LAST - TL_DIR_FIRST,
TL_PC_FIRST = 5,
TL_PC_LAST = 14,
TL_PC_COUNT = TL_PC_LAST - TL_PC_FIRST,
};
class Board {
public:
enum Result { SOLVED, STUCK, UNKNOWN };
explicit Board(const u64 (&bbs)[TL_COUNT]) noexcept {
memcpy(bbs_, bbs, 8*TL_COUNT);
}
const u64 (&bbs() const noexcept)[TL_COUNT] { return bbs_; }
u64 get(Tile tile) const noexcept { return bbs_[tile]; }
Result result() const noexcept {
bool solved = true;
FOR(i, TL_PC_FIRST, TL_PC_LAST) {
int k = __builtin_popcountll(bbs_[i]);
if(k == 1) return STUCK;
if(k >= 2) solved = false;
}
return solved ? SOLVED : UNKNOWN;
}
// (area,up,down,left,right)
tuple<u64,u64,u64,u64,u64> moves(u64 point) const noexcept {
u64 ar = area(point);
return {
ar,
bbs_[TL_U] & ar,
bbs_[TL_D] & ar,
bbs_[TL_L] & ar,
bbs_[TL_R] & ar,
};
}
void rotate_up(int x) noexcept {
u64 mask = 0x01010101'01010101 << x;
for(auto& bb : bbs_) {
u64 tmp = __rorq(bb, 8);
bb = (tmp&mask) | (bb&~mask);
}
erase_pcs();
}
void rotate_down(int x) noexcept {
u64 mask = 0x01010101'01010101 << x;
for(auto& bb : bbs_) {
u64 tmp = __rolq(bb, 8);
bb = (tmp&mask) | (bb&~mask);
}
erase_pcs();
}
void rotate_left(int y) noexcept {
for(auto& bb : bbs_) {
u64 tmp = __rorq(bb, 8*y);
u64 b = __rorb(u8(tmp), 1);
bb = __rolq(b|(tmp&~0xFF), 8*y);
}
erase_pcs();
}
void rotate_right(int y) noexcept {
for(auto& bb : bbs_) {
u64 tmp = __rorq(bb, 8*y);
u64 b = __rolb(u8(tmp), 1);
bb = __rolq(b|(tmp&~0xFF), 8*y);
}
erase_pcs();
}
// 解くまでに最低限必要な手数を求める
// 既に解かれている局面に対しては 0 を返す
// 解がない(STUCK)局面に対しては 255 を返す
// 盤面は正しいと仮定する(消えるはずのピースが消えていないとかはナシ)
// ピース間の距離で判断(15パズルのマンハッタン距離枝刈りみたいな感じ)
int least_to_solve() const noexcept {
int res = 0;
FOR(pc, TL_PC_FIRST, TL_PC_LAST) {
u64 bb = bbs_[pc];
if(bb == 0) continue;
int indices[31];
int cnt = 0;
while(bb != 0) {
int i = bitboard_bsf(bb);
bb &= (bb-1);
indices[cnt++] = i;
}
if(cnt == 1) return 255;
int cur = 255;
REP(i, cnt) FOR(j, i+1, cnt) {
int a = indices[i];
int b = indices[j];
chmin(cur, LEAST_TO_SOLVE[a][b]);
if(cur == 1) goto finish_pc;
}
finish_pc:
chmax(res, cur);
}
return res;
}
void write_to(ostream& out) const {
vector<string> grid(8, string(8,SYM_EMPTY));
REP(y, 8) REP(x, 8) {
int i = yx2idx(y,x);
FOR(j, TL_FIRST, TL_LAST) {
if(bbs_[j] & (1ULL<<i)) {
grid[y][x] = SYMS_TL[j-TL_FIRST];
break;
}
}
}
for(const auto& s : grid)
out << s << '\n';
}
static Board read_from(istream& in) {
vector<string> grid(8);
REP(y, 8) {
in >> grid[y];
}
u64 bbs[TL_COUNT] {};
REP(y, 8) REP(x, 8) {
char c = grid[y][x];
int i = yx2idx(y,x);
FOR(j, TL_FIRST, TL_LAST) {
char sym = SYMS_TL[j-TL_FIRST];
if(c == sym) {
bbs[j] |= 1ULL << i;
break;
}
}
}
return Board(bbs);
}
private:
static constexpr u8 LEAST_TO_SOLVE[64][64] {
{ 0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1 },
{ 0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3,1,1,1,2,3,4,3,2 },
{ 1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3,3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4,2,1,1,1,2,3,4,3 },
{ 2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4,4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5,3,2,1,1,1,2,3,4 },
{ 3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3,5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4,4,3,2,1,1,1,2,3 },
{ 2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2,4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3,3,4,3,2,1,1,1,2 },
{ 1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1,3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2,2,3,4,3,2,1,1,1 },
{ 1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,1 },
{ 0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2 },
{ 1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3 },
{ 2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3,3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4 },
{ 3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4,4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5 },
{ 4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3,5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4 },
{ 3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2,4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3 },
{ 2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1,3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2 },
{ 1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1 },
{ 1,2,3,4,5,4,3,2,0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3 },
{ 2,1,2,3,4,5,4,3,1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4 },
{ 3,2,1,2,3,4,5,4,2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3,3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5 },
{ 4,3,2,1,2,3,4,5,3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4,4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6 },
{ 5,4,3,2,1,2,3,4,4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3,5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5 },
{ 4,5,4,3,2,1,2,3,3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2,4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4 },
{ 3,4,5,4,3,2,1,2,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1,3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3 },
{ 2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2 },
{ 2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2,0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4 },
{ 3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3,1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5 },
{ 4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4,2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3,3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6 },
{ 5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5,3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4,4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7 },
{ 6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4,4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3,5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6 },
{ 5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3,3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2,4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5 },
{ 4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1,3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4 },
{ 3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3 },
{ 3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2,0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3 },
{ 4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3,1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4 },
{ 5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4,2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3,3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5 },
{ 6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5,3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4,4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6 },
{ 7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4,4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3,5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5 },
{ 6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3,3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2,4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4 },
{ 5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1,3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3 },
{ 4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2 },
{ 2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2,0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2 },
{ 3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3,1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,2,1,2,3,4,5,4,3 },
{ 4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4,2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3,3,2,1,2,3,4,5,4 },
{ 5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5,3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4,4,3,2,1,2,3,4,5 },
{ 6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4,4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3,5,4,3,2,1,2,3,4 },
{ 5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3,3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2,4,5,4,3,2,1,2,3 },
{ 4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1,3,4,5,4,3,2,1,2 },
{ 3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1 },
{ 1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2,0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2,1 },
{ 2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3,1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1,1,0,1,2,3,4,3,2 },
{ 3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4,2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2,2,1,0,1,2,3,4,3 },
{ 4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5,3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3,3,2,1,0,1,2,3,4 },
{ 5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4,4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2,4,3,2,1,0,1,2,3 },
{ 4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3,3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1,3,4,3,2,1,0,1,2 },
{ 3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0,2,3,4,3,2,1,0,1 },
{ 2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,1,2,3,4,3,2,1,0 },
{ 1,1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,2,3,4,5,6,5,4,3,3,4,5,6,7,6,5,4,2,3,4,5,6,5,4,3,1,2,3,4,5,4,3,2,0,1,2,3,4,3,2,1,0,0,1,2,3,2,1,1 },
{ 1,1,1,2,3,4,3,2,2,1,2,3,4,5,4,3,3,2,3,4,5,6,5,4,4,3,4,5,6,7,6,5,3,2,3,4,5,6,5,4,2,1,2,3,4,5,4,3,1,0,1,2,3,4,3,2,0,0,0,1,2,3,2,1 },
{ 2,1,1,1,2,3,4,3,3,2,1,2,3,4,5,4,4,3,2,3,4,5,6,5,5,4,3,4,5,6,7,6,4,3,2,3,4,5,6,5,3,2,1,2,3,4,5,4,2,1,0,1,2,3,4,3,1,0,0,0,1,2,3,2 },
{ 3,2,1,1,1,2,3,4,4,3,2,1,2,3,4,5,5,4,3,2,3,4,5,6,6,5,4,3,4,5,6,7,5,4,3,2,3,4,5,6,4,3,2,1,2,3,4,5,3,2,1,0,1,2,3,4,2,1,0,0,0,1,2,3 },
{ 4,3,2,1,1,1,2,3,5,4,3,2,1,2,3,4,6,5,4,3,2,3,4,5,7,6,5,4,3,4,5,6,6,5,4,3,2,3,4,5,5,4,3,2,1,2,3,4,4,3,2,1,0,1,2,3,3,2,1,0,0,0,1,2 },
{ 3,4,3,2,1,1,1,2,4,5,4,3,2,1,2,3,5,6,5,4,3,2,3,4,6,7,6,5,4,3,4,5,5,6,5,4,3,2,3,4,4,5,4,3,2,1,2,3,3,4,3,2,1,0,1,2,2,3,2,1,0,0,0,1 },
{ 2,3,4,3,2,1,1,1,3,4,5,4,3,2,1,2,4,5,6,5,4,3,2,3,5,6,7,6,5,4,3,4,4,5,6,5,4,3,2,3,3,4,5,4,3,2,1,2,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0,0 },
{ 1,2,3,4,3,2,1,1,2,3,4,5,4,3,2,1,3,4,5,6,5,4,3,2,4,5,6,7,6,5,4,3,3,4,5,6,5,4,3,2,2,3,4,5,4,3,2,1,1,2,3,4,3,2,1,0,1,1,2,3,2,1,0,0 },
};
static constexpr char SYMS_TL[TL_COUNT] {
'^','v','<','>','#','0','1','2','3','4','5','6','7','8'
};
static constexpr char SYM_EMPTY = '.';
// 始点 point からの到達可能領域を返す
u64 area(u64 point) const noexcept {
u64 boundary = bbs_[TL_U] | bbs_[TL_D] | bbs_[TL_L] | bbs_[TL_R] | bbs_[TL_WALL];
u64 seed = bitboard_neighbor(point);
u64 res = bitboard_floodfill(boundary, seed);
// このままでは res は境界として壁も含むため、本来同一局面のも
// のが始点によって異なる局面とみなされてしまう。そこで壁を除
// 外したbitboardを返す。
res &= ~bbs_[TL_WALL];
return res;
}
void erase_pcs() noexcept {
FOR(i, TL_PC_FIRST, TL_PC_LAST) {
bbs_[i] &= ~bitboard_neighbor(bbs_[i]);
}
}
u64 bbs_[TL_COUNT];
};