Repository navigation
Expand file tree
/
Copy pathFastBoard.cpp
More file actions
605 lines (492 loc) · 16.2 KB
/
Copy pathFastBoard.cpp
File metadata and controls
605 lines (492 loc) · 16.2 KB
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
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
/*
This file is part of Leela Zero.
Copyright (C) 2017-2019 Gian-Carlo Pascutto and contributors
Leela Zero is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Leela Zero is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Leela Zero. If not, see <http://www.gnu.org/licenses/>.
Additional permission under GNU GPL version 3 section 7
If you modify this Program, or any covered work, by linking or
combining it with NVIDIA Corporation's libraries from the
NVIDIA CUDA Toolkit and/or the NVIDIA CUDA Deep Neural
Network library and/or the NVIDIA TensorRT inference library
(or a modified version of those libraries), containing parts covered
by the terms of the respective license agreement, the licensors of
this Program grant you additional permission to convey the resulting
work.
*/
#include "FastBoard.h"
#include <cassert>
#include <cctype>
#include <algorithm>
#include <array>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include "Utils.h"
#include "config.h"
using namespace Utils;
const int FastBoard::NBR_SHIFT;
const int FastBoard::NUM_VERTICES;
const int FastBoard::NO_VERTEX;
const int FastBoard::PASS;
const int FastBoard::RESIGN;
const std::array<int, 2> FastBoard::s_eyemask = {
4 * (1 << (NBR_SHIFT * BLACK)),
4 * (1 << (NBR_SHIFT * WHITE))
};
const std::array<FastBoard::vertex_t, 4> FastBoard::s_cinvert = {
WHITE, BLACK, EMPTY, INVAL
};
int FastBoard::get_boardsize() const {
return m_boardsize;
}
int FastBoard::get_vertex(int x, int y) const {
assert(x >= 0 && x < BOARD_SIZE);
assert(y >= 0 && y < BOARD_SIZE);
assert(x >= 0 && x < m_boardsize);
assert(y >= 0 && y < m_boardsize);
int vertex = ((y + 1) * m_sidevertices) + (x + 1);
assert(vertex >= 0 && vertex < m_numvertices);
return vertex;
}
std::pair<int, int> FastBoard::get_xy(int vertex) const {
//int vertex = ((y + 1) * (get_boardsize() + 2)) + (x + 1);
int x = (vertex % m_sidevertices) - 1;
int y = (vertex / m_sidevertices) - 1;
assert(x >= 0 && x < m_boardsize);
assert(y >= 0 && y < m_boardsize);
assert(get_vertex(x, y) == vertex);
return std::make_pair(x, y);
}
FastBoard::vertex_t FastBoard::get_state(int vertex) const {
assert(vertex >= 0 && vertex < NUM_VERTICES);
assert(vertex >= 0 && vertex < m_numvertices);
return m_state[vertex];
}
void FastBoard::set_state(int vertex, FastBoard::vertex_t content) {
assert(vertex >= 0 && vertex < NUM_VERTICES);
assert(vertex >= 0 && vertex < m_numvertices);
assert(content >= BLACK && content <= INVAL);
m_state[vertex] = content;
}
FastBoard::vertex_t FastBoard::get_state(int x, int y) const {
return get_state(get_vertex(x, y));
}
void FastBoard::set_state(int x, int y, FastBoard::vertex_t content) {
set_state(get_vertex(x, y), content);
}
void FastBoard::reset_board(int size) {
m_boardsize = size;
m_sidevertices = size + 2;
m_numvertices = m_sidevertices * m_sidevertices;
m_tomove = BLACK;
m_prisoners[BLACK] = 0;
m_prisoners[WHITE] = 0;
m_empty_cnt = 0;
m_dirs[0] = -m_sidevertices;
m_dirs[1] = +1;
m_dirs[2] = +m_sidevertices;
m_dirs[3] = -1;
for (int i = 0; i < m_numvertices; i++) {
m_state[i] = INVAL;
m_neighbours[i] = 0;
m_parent[i] = NUM_VERTICES;
}
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
int vertex = get_vertex(i, j);
m_state[vertex] = EMPTY;
m_empty_idx[vertex] = m_empty_cnt;
m_empty[m_empty_cnt++] = vertex;
if (i == 0 || i == size - 1) {
m_neighbours[vertex] += (1 << (NBR_SHIFT * BLACK))
| (1 << (NBR_SHIFT * WHITE));
m_neighbours[vertex] += 1 << (NBR_SHIFT * EMPTY);
} else {
m_neighbours[vertex] += 2 << (NBR_SHIFT * EMPTY);
}
if (j == 0 || j == size - 1) {
m_neighbours[vertex] += (1 << (NBR_SHIFT * BLACK))
| (1 << (NBR_SHIFT * WHITE));
m_neighbours[vertex] += 1 << (NBR_SHIFT * EMPTY);
} else {
m_neighbours[vertex] += 2 << (NBR_SHIFT * EMPTY);
}
}
}
m_parent[NUM_VERTICES] = NUM_VERTICES;
m_libs[NUM_VERTICES] = 16384; /* we will subtract from this */
m_next[NUM_VERTICES] = NUM_VERTICES;
assert(m_state[NO_VERTEX] == INVAL);
}
bool FastBoard::is_suicide(int i, int color) const {
// If there are liberties next to us, it is never suicide
if (count_pliberties(i)) {
return false;
}
// If we get here, we played in a "hole" surrounded by stones
for (auto k = 0; k < 4; k++) {
auto ai = i + m_dirs[k];
auto libs = m_libs[m_parent[ai]];
if (get_state(ai) == color) {
if (libs > 1) {
// connecting to live group = not suicide
return false;
}
} else if (get_state(ai) == !color) {
if (libs <= 1) {
// killing neighbour = not suicide
return false;
}
}
}
// We played in a hole, friendlies had one liberty at most and
// we did not kill anything. So we killed ourselves.
return true;
}
int FastBoard::count_pliberties(const int i) const {
return count_neighbours(EMPTY, i);
}
// count neighbours of color c at vertex v
// the border of the board has fake neighours of both colors
int FastBoard::count_neighbours(const int c, const int v) const {
assert(c == WHITE || c == BLACK || c == EMPTY);
return (m_neighbours[v] >> (NBR_SHIFT * c)) & NBR_MASK;
}
void FastBoard::add_neighbour(const int vtx, const int color) {
assert(color == WHITE || color == BLACK || color == EMPTY);
std::array<int, 4> nbr_pars;
int nbr_par_cnt = 0;
for (int k = 0; k < 4; k++) {
int ai = vtx + m_dirs[k];
m_neighbours[ai] += (1 &
10BC8
lt;< (NBR_SHIFT * color)) - (1 << (NBR_SHIFT * EMPTY));
bool found = false;
for (int i = 0; i < nbr_par_cnt; i++) {
if (nbr_pars[i] == m_parent[ai]) {
found = true;
break;
}
}
if (!found) {
m_libs[m_parent[ai]]--;
nbr_pars[nbr_par_cnt++] = m_parent[ai];
}
}
}
void FastBoard::remove_neighbour(const int vtx, const int color) {
assert(color == WHITE || color == BLACK || color == EMPTY);
std::array<int, 4> nbr_pars;
int nbr_par_cnt = 0;
for (int k = 0; k < 4; k++) {
int ai = vtx + m_dirs[k];
m_neighbours[ai] += (1 << (NBR_SHIFT * EMPTY))
- (1 << (NBR_SHIFT * color));
bool found = false;
for (int i = 0; i < nbr_par_cnt; i++) {
if (nbr_pars[i] == m_parent[ai]) {
found = true;
break;
}
}
if (!found) {
m_libs[m_parent[ai]]++;
nbr_pars[nbr_par_cnt++] = m_parent[ai];
}
}
}
int FastBoard::calc_reach_color(int color) const {
auto reachable = 0;
auto bd = std::vector<bool>(m_numvertices, false);
auto open = std::queue<int>();
for (auto i = 0; i < m_boardsize; i++) {
for (auto j = 0; j < m_boardsize; j++) {
auto vertex = get_vertex(i, j);
if (m_state[vertex] == color) {
reachable++;
bd[vertex] = true;
open.push(vertex);
}
}
}
while (!open.empty()) {
/* colored field, spread */
auto vertex = open.front();
open.pop();
for (auto k = 0; k < 4; k++) {
auto neighbor = vertex + m_dirs[k];
if (!bd[neighbor] && m_state[neighbor] == EMPTY) {
reachable++;
bd[neighbor] = true;
open.push(neighbor);
}
}
}
return reachable;
}
// Needed for scoring passed out games not in MC playouts
float FastBoard::area_score(float komi) const {
auto white = calc_reach_color(WHITE);
auto black = calc_reach_color(BLACK);
return black - white - komi;
}
void FastBoard::display_board(int lastmove) {
int boardsize = get_boardsize();
myprintf("\n ");
print_columns();
for (int j = boardsize-1; j >= 0; j--) {
myprintf("%2d", j+1);
if (lastmove == get_vertex(0, j))
myprintf("(");
else
myprintf(" ");
for (int i = 0; i < boardsize; i++) {
if (get_state(i,j) == WHITE) {
myprintf("O");
} else if (get_state(i,j) == BLACK) {
myprintf("X");
} else if (starpoint(boardsize, i, j)) {
myprintf("+");
} else {
myprintf(".");
}
if (lastmove == get_vertex(i, j)) myprintf(")");
else if (i != boardsize-1 && lastmove == get_vertex(i, j)+1) myprintf("(");
else myprintf(" ");
}
myprintf("%2d\n", j+1);
}
myprintf(" ");
print_columns();
myprintf("\n");
}
void FastBoard::print_columns() {
for (int i = 0; i < get_boardsize(); i++) {
if (i < 25) {
myprintf("%c ", (('a' + i < 'i') ? 'a' + i : 'a' + i + 1));
} else {
myprintf("%c ", (('A' + (i - 25) < 'I') ? 'A' + (i - 25) : 'A' + (i - 25) + 1));
}
}
myprintf("\n");
}
void FastBoard::merge_strings(const int ip, const int aip) {
assert(ip != NUM_VERTICES && aip != NUM_VERTICES);
/* merge stones */
m_stones[ip] += m_stones[aip];
/* loop over stones, update parents */
int newpos = aip;
do {
// check if this stone has a liberty
for (int k = 0; k < 4; k++) {
int ai = newpos + m_dirs[k];
// for each liberty, check if it is not shared
if (m_state[ai] == EMPTY) {
// find liberty neighbors
bool found = false;
for (int kk = 0; kk < 4; kk++) {
int aai = ai + m_dirs[kk];
// friendly string shouldn't be ip
// ip can also be an aip that has been marked
if (m_parent[aai] == ip) {
found = true;
break;
}
}
if (!found) {
m_libs[ip]++;
}
}
}
m_parent[newpos] = ip;
newpos = m_next[newpos];
} while (newpos != aip);
/* merge stings */
std::swap(m_next[aip], m_next[ip]);
}
bool FastBoard::is_eye(const int color, const int i) const {
/* check for 4 neighbors of the same color */
int ownsurrounded = (m_neighbours[i] & s_eyemask[color]);
// if not, it can't be an eye
// this takes advantage of borders being colored
// both ways
if (!ownsurrounded) {
return false;
}
// 2 or more diagonals taken
// 1 for side groups
int colorcount[4];
colorcount[BLACK] = 0;
colorcount[WHITE] = 0;
colorcount[INVAL] = 0;
colorcount[m_state[i - 1 - m_sidevertices]]++;
colorcount[m_state[i + 1 - m_sidevertices]]++;
colorcount[m_state[i - 1 + m_sidevertices]]++;
colorcount[m_state[i + 1 + m_sidevertices]]++;
if (colorcount[INVAL] == 0) {
if (colorcount[!color] > 1) {
return false;
}
} else {
if (colorcount[!color]) {
return false;
}
}
return true;
}
std::string FastBoard::move_to_text(int move) const {
std::ostringstream result;
int column = move % m_sidevertices;
int row = move / m_sidevertices;
column--;
row--;
assert(move == FastBoard::PASS
|| move == FastBoard::RESIGN
|| (row >= 0 && row < m_boardsize));
assert(move == FastBoard::PASS
|| move == FastBoard::RESIGN
|| (column >= 0 && column < m_boardsize));
if (move >= 0 && move <= m_numvertices) {
result << static_cast<char>(column < 8 ? 'A' + column : 'A' + column + 1);
result << (row + 1);
} else if (move == FastBoard::PASS) {
result << "pass";
} else if (move == FastBoard::RESIGN) {
result << "resign";
} else {
result << "error";
}
return result.str();
}
int FastBoard::text_to_move(std::string move) const {
transform(cbegin(move), cend(move), begin(move), tolower);
if (move == "pass") {
return PASS;
} else if (move == "resign") {
return RESIGN;
} else if (move.size() < 2 || !std::isalpha(move[0]) || !std::isdigit(move[1]) || move[0] == 'i') {
return NO_VERTEX;
}
auto column = move[0] - 'a';
if (move[0] > 'i') {
--column;
}
int row;
std::istringstream parsestream(move.substr(1));
parsestream >> row;
--row;
if (row >= m_boardsize || column >= m_boardsize) {
return NO_VERTEX;
}
return get_vertex(column, row);
}
std::string FastBoard::move_to_text_sgf(int move) const {
std::ostringstream result;
int column = move % m_sidevertices;
int row = move / m_sidevertices;
column--;
row--;
assert(move == FastBoard::PASS
|| move == FastBoard::RESIGN
|| (row >= 0 && row < m_boardsize));
assert(move == FastBoard::PASS
|| move == FastBoard::RESIGN
|| (column >= 0 && column < m_boardsize));
// SGF inverts rows
row = m_boardsize - row - 1;
if (move >= 0 && move <= m_numvertices) {
if (column <= 25) {
result << static_cast<char>('a' + column);
} else {
result << static_cast<char>('A' + column - 26);
}
if (row <= 25) {
result << static_cast<char>('a' + row);
} else {
result << static_cast<char>('A' + row - 26);
}
} else if (move == FastBoard::PASS) {
result << "tt";
} else if (move == FastBoard::RESIGN) {
result << "tt";
} else {
result << "error";
}
return result.str();
}
bool FastBoard::starpoint(int size, int point) {
int stars[3];
int points[2];
int hits = 0;
if (size % 2 == 0 || size < 9) {
return false;
}
stars[0] = size >= 13 ? 3 : 2;
stars[1] = size / 2;
stars[2] = size - 1 - stars[0];
points[0] = point / size;
points[1] = point % size;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 3; j++) {
if (points[i] == stars[j]) {
hits++;
}
}
}
return hits >= 2;
}
bool FastBoard::starpoint(int size, int x, int y) {
return starpoint(size, y * size + x);
}
int FastBoard::get_prisoners(int side) const {
assert(side == WHITE || side == BLACK);
return m_prisoners[side];
}
int FastBoard::get_to_move() const {
return m_tomove;
}
bool FastBoard::black_to_move() const {
return m_tomove == BLACK;
}
bool FastBoard::white_to_move() const {
return m_tomove == WHITE;
}
void FastBoard::set_to_move(int tomove) {
m_tomove = tomove;
}
std::string FastBoard::get_string(int vertex) const {
std::string result;
int start = m_parent[vertex];
int newpos = start;
do {
result += move_to_text(newpos) + " ";
newpos = m_next[newpos];
} while (newpos != start);
// eat last space
assert(result.size() > 0);
result.resize(result.size() - 1);
return result;
}
std::string FastBoard::get_stone_list() const {
std::string result;
for (int i = 0; i < m_boardsize; i++) {
for (int j = 0; j < m_boardsize; j++) {
int vertex = get_vertex(i, j);
if (get_state(vertex) != EMPTY) {
result += move_to_text(vertex) + " ";
}
}
}
// eat final space, if any.
if (result.size() > 0) {
result.resize(result.size() - 1);
}
return result;
}