14 #include "patternsp.h"
20 static void board_trait_recompute(struct board
*board
, coord_t coord
);
29 #define profiling_noinline __attribute__((noinline))
31 #define profiling_noinline
34 #define gi_granularity 4
35 #define gi_allocsize(gids) ((1 << gi_granularity) + ((gids) >> gi_granularity) * (1 << gi_granularity))
39 board_setup(struct board
*b
)
41 memset(b
, 0, sizeof(*b
));
43 struct move m
= { pass
, S_NONE
};
44 b
->last_move
= b
->last_move2
= b
->last_ko
= b
->ko
= m
;
50 struct board
*b
= malloc2(sizeof(struct board
));
61 board_alloc(struct board
*board
)
63 /* We do not allocate the board structure itself but we allocate
64 * all the arrays with board contents. */
66 int bsize
= board_size2(board
) * sizeof(*board
->b
);
67 int gsize
= board_size2(board
) * sizeof(*board
->g
);
68 int fsize
= board_size2(board
) * sizeof(*board
->f
);
69 int nsize
= board_size2(board
) * sizeof(*board
->n
);
70 int psize
= board_size2(board
) * sizeof(*board
->p
);
71 int hsize
= board_size2(board
) * 2 * sizeof(*board
->h
);
72 int gisize
= board_size2(board
) * sizeof(*board
->gi
);
74 int csize
= board_size2(board
) * sizeof(*board
->c
);
79 int ssize
= board_size2(board
) * sizeof(*board
->spathash
);
84 int p3size
= board_size2(board
) * sizeof(*board
->pat3
);
89 int tsize
= board_size2(board
) * sizeof(*board
->t
);
90 int tqsize
= board_size2(board
) * sizeof(*board
->t
);
96 int pbsize
= board_size2(board
) * sizeof(*board
->prob
[0].items
);
97 int rowpbsize
= board_size(board
) * sizeof(*board
->prob
[0].rowtotals
);
102 int cdsize
= board_size2(board
) * sizeof(*board
->coord
);
104 size_t size
= bsize
+ gsize
+ fsize
+ psize
+ nsize
+ hsize
+ gisize
+ csize
+ ssize
+ p3size
+ tsize
+ tqsize
+ (pbsize
+ rowpbsize
) * 2 + cdsize
;
105 void *x
= malloc2(size
);
107 /* board->b must come first */
108 board
->b
= x
; x
+= bsize
;
109 board
->g
= x
; x
+= gsize
;
110 board
->f
= x
; x
+= fsize
;
111 board
->p
= x
; x
+= psize
;
112 board
->n
= x
; x
+= nsize
;
113 board
->h
= x
; x
+= hsize
;
114 board
->gi
= x
; x
+= gisize
;
116 board
->c
= x
; x
+= csize
;
118 #ifdef BOARD_SPATHASH
119 board
->spathash
= x
; x
+= ssize
;
122 board
->pat3
= x
; x
+= p3size
;
125 board
->t
= x
; x
+= tsize
;
126 board
->tq
= x
; x
+= tqsize
;
129 board
->prob
[0].items
= x
; x
+= pbsize
;
130 board
->prob
[1].items
= x
; x
+= pbsize
;
131 board
->prob
[0].rowtotals
= x
; x
+= rowpbsize
;
132 board
->prob
[1].rowtotals
= x
; x
+= rowpbsize
;
134 board
->coord
= x
; x
+= cdsize
;
140 board_copy(struct board
*b2
, struct board
*b1
)
142 memcpy(b2
, b1
, sizeof(struct board
));
144 size_t size
= board_alloc(b2
);
145 memcpy(b2
->b
, b1
->b
, size
);
151 board_done_noalloc(struct board
*board
)
153 if (board
->b
) free(board
->b
);
157 board_done(struct board
*board
)
159 board_done_noalloc(board
);
164 board_resize(struct board
*board
, int size
)
167 assert(board_size(board
) == size
+ 2);
169 board
->size
= size
+ 2 /* S_OFFBOARD margin */;
170 board
->size2
= board_size(board
) * board_size(board
);
173 while ((1 << board
->bits2
) < board
->size2
) board
->bits2
++;
178 size_t asize
= board_alloc(board
);
179 memset(board
->b
, 0, asize
);
183 board_clear(struct board
*board
)
185 int size
= board_size(board
);
186 float komi
= board
->komi
;
188 board_done_noalloc(board
);
190 board_resize(board
, size
- 2 /* S_OFFBOARD margin */);
194 /* Setup neighborhood iterators */
195 board
->nei8
[0] = -size
- 1; // (-1,-1)
198 board
->nei8
[3] = size
- 2; // (-1,0)
200 board
->nei8
[5] = size
- 2; // (-1,1)
203 board
->dnei
[0] = -size
- 1;
205 board
->dnei
[2] = size
*2 - 2;
208 /* Setup initial symmetry */
209 board
->symmetry
.d
= 1;
210 board
->symmetry
.x1
= board
->symmetry
.y1
= board_size(board
) / 2;
211 board
->symmetry
.x2
= board
->symmetry
.y2
= board_size(board
) - 1;
212 board
->symmetry
.type
= SYM_FULL
;
214 /* Set up coordinate cache */
215 foreach_point(board
) {
216 board
->coord
[c
][0] = c
% board_size(board
);
217 board
->coord
[c
][1] = c
/ board_size(board
);
220 /* Draw the offboard margin */
221 int top_row
= board_size2(board
) - board_size(board
);
223 for (i
= 0; i
< board_size(board
); i
++)
224 board
->b
[i
] = board
->b
[top_row
+ i
] = S_OFFBOARD
;
225 for (i
= 0; i
<= top_row
; i
+= board_size(board
))
226 board
->b
[i
] = board
->b
[board_size(board
) - 1 + i
] = S_OFFBOARD
;
228 foreach_point(board
) {
230 if (board_at(board
, coord
) == S_OFFBOARD
)
232 foreach_neighbor(board
, c
, {
233 inc_neighbor_count_at(board
, coord
, board_at(board
, c
));
237 /* All positions are free! Except the margin. */
238 for (i
= board_size(board
); i
< (board_size(board
) - 1) * board_size(board
); i
++)
239 if (i
% board_size(board
) != 0 && i
% board_size(board
) != board_size(board
) - 1)
240 board
->f
[board
->flen
++] = i
;
242 /* Initialize zobrist hashtable. */
243 foreach_point(board
) {
244 int max
= (sizeof(hash_t
) << history_hash_bits
);
245 /* fast_random() is 16-bit only */
246 board
->h
[c
* 2] = ((hash_t
) fast_random(max
))
247 | ((hash_t
) fast_random(max
) << 16)
248 | ((hash_t
) fast_random(max
) << 32)
249 | ((hash_t
) fast_random(max
) << 48);
250 if (!board
->h
[c
* 2])
251 /* Would be kinda "oops". */
253 /* And once again for white */
254 board
->h
[c
* 2 + 1] = ((hash_t
) fast_random(max
))
255 | ((hash_t
) fast_random(max
) << 16)
256 | ((hash_t
) fast_random(max
) << 32)
257 | ((hash_t
) fast_random(max
) << 48);
258 if (!board
->h
[c
* 2 + 1])
259 board
->h
[c
* 2 + 1] = 1;
262 #ifdef BOARD_SPATHASH
263 /* Initialize spatial hashes. */
264 foreach_point(board
) {
265 for (int d
= 1; d
<= BOARD_SPATHASH_MAXD
; d
++) {
266 for (int j
= ptind
[d
]; j
< ptind
[d
+ 1]; j
++) {
267 ptcoords_at(x
, y
, c
, board
, j
);
268 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][0] ^=
269 pthashes
[0][j
][board_at(board
, c
)];
270 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][1] ^=
271 pthashes
[0][j
][stone_other(board_at(board
, c
))];
277 /* Initialize 3x3 pattern codes. */
278 foreach_point(board
) {
279 if (board_at(board
, c
) == S_NONE
)
280 board
->pat3
[c
] = pattern3_hash(board
, c
);
284 /* Initialize traits. */
285 foreach_point(board
) {
286 trait_at(board
, c
, S_BLACK
).cap
= 0;
287 trait_at(board
, c
, S_BLACK
).safe
= true;
288 trait_at(board
, c
, S_WHITE
).cap
= 0;
289 trait_at(board
, c
, S_WHITE
).safe
= true;
293 board
->prob
[0].b
= board
->prob
[1].b
= board
;
294 foreach_point(board
) {
295 probdist_set(&board
->prob
[0], c
, double_to_fixp((board_at(board
, c
) == S_NONE
) * 1.0f
));
296 probdist_set(&board
->prob
[1], c
, double_to_fixp((board_at(board
, c
) == S_NONE
) * 1.0f
));
302 board_print_top(struct board
*board
, char *s
, char *end
, int c
)
304 for (int i
= 0; i
< c
; i
++) {
305 char asdf
[] = "ABCDEFGHJKLMNOPQRSTUVWXYZ";
306 s
+= snprintf(s
, end
- s
, " ");
307 for (int x
= 1; x
< board_size(board
) - 1; x
++)
308 s
+= snprintf(s
, end
- s
, "%c ", asdf
[x
- 1]);
309 s
+= snprintf(s
, end
-s
, " ");
311 s
+= snprintf(s
, end
- s
, "\n");
312 for (int i
= 0; i
< c
; i
++) {
313 s
+= snprintf(s
, end
- s
, " +-");
314 for (int x
= 1; x
< board_size(board
) - 1; x
++)
315 s
+= snprintf(s
, end
- s
, "--");
316 s
+= snprintf(s
, end
- s
, "+");
318 s
+= snprintf(s
, end
- s
, "\n");
323 board_print_bottom(struct board
*board
, char *s
, char *end
, int c
)
325 for (int i
= 0; i
< c
; i
++) {
326 s
+= snprintf(s
, end
- s
, " +-");
327 for (int x
= 1; x
< board_size(board
) - 1; x
++)
328 s
+= snprintf(s
, end
- s
, "--");
329 s
+= snprintf(s
, end
- s
, "+");
331 s
+= snprintf(s
, end
- s
, "\n");
336 board_print_row(struct board
*board
, int y
, char *s
, char *end
, board_cprint cprint
)
338 s
+= snprintf(s
, end
- s
, " %2d | ", y
);
339 for (int x
= 1; x
< board_size(board
) - 1; x
++) {
340 if (coord_x(board
->last_move
.coord
, board
) == x
&& coord_y(board
->last_move
.coord
, board
) == y
)
341 s
+= snprintf(s
, end
- s
, "%c)", stone2char(board_atxy(board
, x
, y
)));
343 s
+= snprintf(s
, end
- s
, "%c ", stone2char(board_atxy(board
, x
, y
)));
345 s
+= snprintf(s
, end
- s
, "|");
347 s
+= snprintf(s
, end
- s
, " %2d | ", y
);
348 for (int x
= 1; x
< board_size(board
) - 1; x
++) {
349 s
= cprint(board
, coord_xy(board
, x
, y
), s
, end
);
351 s
+= snprintf(s
, end
- s
, "|");
353 s
+= snprintf(s
, end
- s
, "\n");
358 board_print_custom(struct board
*board
, FILE *f
, board_cprint cprint
)
362 char *end
= buf
+ sizeof(buf
);
363 s
+= snprintf(s
, end
- s
, "Move: % 3d Komi: %2.1f Handicap: %d Captures B: %d W: %d\n",
364 board
->moves
, board
->komi
, board
->handicap
,
365 board
->captures
[S_BLACK
], board
->captures
[S_WHITE
]);
366 s
= board_print_top(board
, s
, end
, 1 + !!cprint
);
367 for (int y
= board_size(board
) - 2; y
>= 1; y
--)
368 s
= board_print_row(board
, y
, s
, end
, cprint
);
369 board_print_bottom(board
, s
, end
, 1 + !!cprint
);
370 fprintf(f
, "%s\n", buf
);
374 cprint_group(struct board
*board
, coord_t c
, char *s
, char *end
)
376 s
+= snprintf(s
, end
- s
, "%d ", group_base(group_at(board
, c
)));
381 board_print(struct board
*board
, FILE *f
)
383 board_print_custom(board
, f
, DEBUGL(6) ? cprint_group
: NULL
);
387 board_gamma_set(struct board
*b
, struct features_gamma
*gamma
, bool precise_selfatari
)
391 b
->precise_selfatari
= precise_selfatari
;
392 for (int i
= 0; i
< b
->flen
; i
++) {
393 board_trait_recompute(b
, b
->f
[i
]);
399 /* Update the probability distribution we maintain incrementally. */
401 board_gamma_update(struct board
*board
, coord_t coord
, enum stone color
)
407 /* Punch out invalid moves and moves filling our own eyes. */
408 if (board_at(board
, coord
) != S_NONE
409 || (board_is_eyelike(board
, coord
, stone_other(color
))
410 && !trait_at(board
, coord
, color
).cap
)
411 || (board_is_one_point_eye(board
, coord
, color
))) {
412 probdist_set(&board
->prob
[color
- 1], coord
, 0);
416 hash3_t pat
= board
->pat3
[coord
];
417 if (color
== S_WHITE
) {
418 /* We work with the pattern3s as black-to-play. */
419 pat
= pattern3_reverse(pat
);
422 /* We just quickly replicate the general pattern matcher stuff
423 * here in the most bare-bone way. */
424 double value
= board
->gamma
->gamma
[FEAT_PATTERN3
][pat
];
425 if (trait_at(board
, coord
, color
).cap
)
426 value
*= board
->gamma
->gamma
[FEAT_CAPTURE
][0];
427 if (trait_at(board
, coord
, stone_other(color
)).cap
428 && trait_at(board
, coord
, color
).safe
)
429 value
*= board
->gamma
->gamma
[FEAT_AESCAPE
][0];
430 if (!trait_at(board
, coord
, color
).safe
)
431 value
*= board
->gamma
->gamma
[FEAT_SELFATARI
][1 + board
->precise_selfatari
];
432 probdist_set(&board
->prob
[color
- 1], coord
, double_to_fixp(value
));
438 board_trait_safe(struct board
*board
, coord_t coord
, enum stone color
)
440 if (board
->precise_selfatari
)
441 return !is_bad_selfatari(board
, color
, coord
);
443 return board_safe_to_play(board
, coord
, color
);
447 board_trait_recompute(struct board
*board
, coord_t coord
)
449 trait_at(board
, coord
, S_BLACK
).safe
= board_trait_safe(board
, coord
, S_BLACK
);;
450 trait_at(board
, coord
, S_WHITE
).safe
= board_trait_safe(board
, coord
, S_WHITE
);
452 fprintf(stderr
, "traits[%s:%s lib=%d] (black cap=%d safe=%d) (white cap=%d safe=%d)\n",
453 coord2sstr(coord
, board
), stone2str(board_at(board
, coord
)), immediate_liberty_count(board
, coord
),
454 trait_at(board
, coord
, S_BLACK
).cap
, trait_at(board
, coord
, S_BLACK
).safe
,
455 trait_at(board
, coord
, S_WHITE
).cap
, trait_at(board
, coord
, S_WHITE
).safe
);
457 board_gamma_update(board
, coord
, S_BLACK
);
458 board_gamma_update(board
, coord
, S_WHITE
);
462 /* Recompute traits for dirty points that we have previously touched
463 * somehow (libs of their neighbors changed or so). */
465 board_traits_recompute(struct board
*board
)
468 for (int i
= 0; i
< board
->tqlen
; i
++) {
469 coord_t coord
= board
->tq
[i
];
470 trait_at(board
, coord
, S_BLACK
).dirty
= false;
471 if (board_at(board
, coord
) != S_NONE
)
473 board_trait_recompute(board
, coord
);
479 /* Queue traits of given point for recomputing. */
481 board_trait_queue(struct board
*board
, coord_t coord
)
484 if (trait_at(board
, coord
, S_BLACK
).dirty
)
486 board
->tq
[board
->tqlen
++] = coord
;
487 trait_at(board
, coord
, S_BLACK
).dirty
= true;
492 /* Update board hash with given coordinate. */
493 static void profiling_noinline
494 board_hash_update(struct board
*board
, coord_t coord
, enum stone color
)
496 board
->hash
^= hash_at(board
, coord
, color
);
498 fprintf(stderr
, "board_hash_update(%d,%d,%d) ^ %"PRIhash
" -> %"PRIhash
"\n", color
, coord_x(coord
, board
), coord_y(coord
, board
), hash_at(board
, coord
, color
), board
->hash
);
500 #ifdef BOARD_SPATHASH
501 /* Gridcular metric is reflective, so we update all hashes
502 * of appropriate ditance in OUR circle. */
503 for (int d
= 1; d
<= BOARD_SPATHASH_MAXD
; d
++) {
504 for (int j
= ptind
[d
]; j
< ptind
[d
+ 1]; j
++) {
505 ptcoords_at(x
, y
, coord
, board
, j
);
506 /* We either changed from S_NONE to color
507 * or vice versa; doesn't matter. */
508 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][0] ^=
509 pthashes
[0][j
][color
] ^ pthashes
[0][j
][S_NONE
];
510 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][1] ^=
511 pthashes
[0][j
][stone_other(color
)] ^ pthashes
[0][j
][S_NONE
];
516 #if defined(BOARD_PAT3)
517 /* @color is not what we need in case of capture. */
518 enum stone new_color
= board_at(board
, coord
);
519 if (new_color
== S_NONE
)
520 board
->pat3
[coord
] = pattern3_hash(board
, coord
);
521 foreach_8neighbor(board
, coord
) { // internally, the loop uses fn__i=[0..7]
522 if (board_at(board
, c
) != S_NONE
)
524 board
->pat3
[c
] &= ~(3 << (fn__i
*2));
525 board
->pat3
[c
] |= new_color
<< (fn__i
*2);
527 if (board_at(board
, c
) != S_OFFBOARD
&& pattern3_hash(board
, c
) != board
->pat3
[c
]) {
528 board_print(board
, stderr
);
529 fprintf(stderr
, "%s->%s %x != %x (%d-%d:%d)\n", coord2sstr(coord
, board
), coord2sstr(c
, board
), pattern3_hash(board
, c
), board
->pat3
[c
], coord
, c
, fn__i
);
533 board_trait_queue(board
, c
);
534 } foreach_8neighbor_end
;
538 /* Commit current board hash to history. */
539 static void profiling_noinline
540 board_hash_commit(struct board
*board
)
543 fprintf(stderr
, "board_hash_commit %"PRIhash
"\n", board
->hash
);
544 if (likely(board
->history_hash
[board
->hash
& history_hash_mask
]) == 0) {
545 board
->history_hash
[board
->hash
& history_hash_mask
] = board
->hash
;
547 hash_t i
= board
->hash
;
548 while (board
->history_hash
[i
& history_hash_mask
]) {
549 if (board
->history_hash
[i
& history_hash_mask
] == board
->hash
) {
551 fprintf(stderr
, "SUPERKO VIOLATION noted at %d,%d\n",
552 coord_x(board
->last_move
.coord
, board
), coord_y(board
->last_move
.coord
, board
));
553 board
->superko_violation
= true;
556 i
= history_hash_next(i
);
558 board
->history_hash
[i
& history_hash_mask
] = board
->hash
;
564 board_symmetry_update(struct board
*b
, struct board_symmetry
*symmetry
, coord_t c
)
566 if (likely(symmetry
->type
== SYM_NONE
)) {
567 /* Fully degenerated already. We do not support detection
568 * of restoring of symmetry, assuming that this is too rare
569 * a case to handle. */
573 int x
= coord_x(c
, b
), y
= coord_y(c
, b
), t
= board_size(b
) / 2;
574 int dx
= board_size(b
) - 1 - x
; /* for SYM_DOWN */
576 fprintf(stderr
, "SYMMETRY [%d,%d,%d,%d|%d=%d] update for %d,%d\n",
577 symmetry
->x1
, symmetry
->y1
, symmetry
->x2
, symmetry
->y2
,
578 symmetry
->d
, symmetry
->type
, x
, y
);
581 switch (symmetry
->type
) {
583 if (x
== t
&& y
== t
) {
584 /* Tengen keeps full symmetry. */
587 /* New symmetry now? */
589 symmetry
->type
= SYM_DIAG_UP
;
590 symmetry
->x1
= symmetry
->y1
= 1;
591 symmetry
->x2
= symmetry
->y2
= board_size(b
) - 1;
593 } else if (dx
== y
) {
594 symmetry
->type
= SYM_DIAG_DOWN
;
595 symmetry
->x1
= symmetry
->y1
= 1;
596 symmetry
->x2
= symmetry
->y2
= board_size(b
) - 1;
599 symmetry
->type
= SYM_HORIZ
;
601 symmetry
->y2
= board_size(b
) - 1;
604 symmetry
->type
= SYM_VERT
;
606 symmetry
->x2
= board_size(b
) - 1;
610 symmetry
->type
= SYM_NONE
;
611 symmetry
->x1
= symmetry
->y1
= 1;
612 symmetry
->x2
= symmetry
->y2
= board_size(b
) - 1;
638 fprintf(stderr
, "NEW SYMMETRY [%d,%d,%d,%d|%d=%d]\n",
639 symmetry
->x1
, symmetry
->y1
, symmetry
->x2
, symmetry
->y2
,
640 symmetry
->d
, symmetry
->type
);
647 board_handicap_stone(struct board
*board
, int x
, int y
, FILE *f
)
650 m
.color
= S_BLACK
; m
.coord
= coord_xy(board
, x
, y
);
652 board_play(board
, &m
);
653 /* Simulate white passing; otherwise, UCT search can get confused since
654 * tree depth parity won't match the color to move. */
657 char *str
= coord2str(m
.coord
, board
);
659 fprintf(stderr
, "choosing handicap %s (%d,%d)\n", str
, x
, y
);
660 if (f
) fprintf(f
, "%s ", str
);
665 board_handicap(struct board
*board
, int stones
, FILE *f
)
667 int margin
= 3 + (board_size(board
) >= 13);
669 int mid
= board_size(board
) / 2;
670 int max
= board_size(board
) - 1 - margin
;
671 const int places
[][2] = {
672 { min
, min
}, { max
, max
}, { max
, min
}, { min
, max
},
673 { min
, mid
}, { max
, mid
},
674 { mid
, min
}, { mid
, max
},
678 board
->handicap
= stones
;
680 if (stones
== 5 || stones
== 7) {
681 board_handicap_stone(board
, mid
, mid
, f
);
686 for (i
= 0; i
< stones
; i
++)
687 board_handicap_stone(board
, places
[i
][0], places
[i
][1], f
);
691 static void __attribute__((noinline
))
692 check_libs_consistency(struct board
*board
, group_t g
)
696 struct group
*gi
= &board_group_info(board
, g
);
697 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++)
698 if (gi
->lib
[i
] && board_at(board
, gi
->lib
[i
]) != S_NONE
) {
699 fprintf(stderr
, "BOGUS LIBERTY %s of group %d[%s]\n", coord2sstr(gi
->lib
[i
], board
), g
, coord2sstr(group_base(g
), board
));
706 board_capturable_add(struct board
*board
, group_t group
, coord_t lib
)
708 //fprintf(stderr, "group %s cap %s\n", coord2sstr(group, board), coord2sstr(lib, boarD));
710 /* Increase capturable count trait of my last lib. */
711 enum stone capturing_color
= stone_other(board_at(board
, group
));
712 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
713 foreach_neighbor(board
, lib
, {
714 if (DEBUGL(8) && group_at(board
, c
) == group
)
715 fprintf(stderr
, "%s[%d] %s cap bump bc of %s(%d) member %s\n", coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
, stone2str(capturing_color
), coord2sstr(group
, board
), board_group_info(board
, group
).libs
, coord2sstr(c
, board
));
716 trait_at(board
, lib
, capturing_color
).cap
+= (group_at(board
, c
) == group
);
718 board_trait_queue(board
, lib
);
722 /* Update the list of capturable groups. */
724 assert(board
->clen
< board_size2(board
));
725 board
->c
[board
->clen
++] = group
;
729 board_capturable_rm(struct board
*board
, group_t group
, coord_t lib
)
731 //fprintf(stderr, "group %s nocap %s\n", coord2sstr(group, board), coord2sstr(lib, board));
733 /* Decrease capturable count trait of my previously-last lib. */
734 enum stone capturing_color
= stone_other(board_at(board
, group
));
735 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
736 foreach_neighbor(board
, lib
, {
737 if (DEBUGL(8) && group_at(board
, c
) == group
)
738 fprintf(stderr
, "%s[%d] cap dump bc of %s(%d) member %s\n", coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
, coord2sstr(group
, board
), board_group_info(board
, group
).libs
, coord2sstr(c
, board
));
739 trait_at(board
, lib
, capturing_color
).cap
-= (group_at(board
, c
) == group
);
741 board_trait_queue(board
, lib
);
745 /* Update the list of capturable groups. */
746 for (int i
= 0; i
< board
->clen
; i
++) {
747 if (unlikely(board
->c
[i
] == group
)) {
748 board
->c
[i
] = board
->c
[--board
->clen
];
752 fprintf(stderr
, "rm of bad group %d\n", group_base(group
));
758 board_atariable_add(struct board
*board
, group_t group
, coord_t lib1
, coord_t lib2
)
761 board_trait_queue(board
, lib1
);
762 board_trait_queue(board
, lib2
);
766 board_atariable_rm(struct board
*board
, group_t group
, coord_t lib1
, coord_t lib2
)
769 board_trait_queue(board
, lib1
);
770 board_trait_queue(board
, lib2
);
775 board_group_addlib(struct board
*board
, group_t group
, coord_t coord
)
778 fprintf(stderr
, "Group %d[%s] %d: Adding liberty %s\n",
779 group_base(group
), coord2sstr(group_base(group
), board
),
780 board_group_info(board
, group
).libs
, coord2sstr(coord
, board
));
783 check_libs_consistency(board
, group
);
785 struct group
*gi
= &board_group_info(board
, group
);
786 if (gi
->libs
< GROUP_KEEP_LIBS
) {
787 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++) {
789 /* Seems extra branch just slows it down */
793 if (unlikely(gi
->lib
[i
] == coord
))
797 board_capturable_add(board
, group
, coord
);
798 } else if (gi
->libs
== 1) {
799 board_capturable_rm(board
, group
, gi
->lib
[0]);
800 board_atariable_add(board
, group
, gi
->lib
[0], coord
);
801 } else if (gi
->libs
== 2) {
802 board_atariable_rm(board
, group
, gi
->lib
[0], gi
->lib
[1]);
804 gi
->lib
[gi
->libs
++] = coord
;
807 check_libs_consistency(board
, group
);
811 board_group_find_extra_libs(struct board
*board
, group_t group
, struct group
*gi
, coord_t avoid
)
813 /* Add extra liberty from the board to our liberty list. */
814 unsigned char watermark
[board_size2(board
) / 8];
815 memset(watermark
, 0, sizeof(watermark
));
816 #define watermark_get(c) (watermark[c >> 3] & (1 << (c & 7)))
817 #define watermark_set(c) watermark[c >> 3] |= (1 << (c & 7))
819 for (int i
= 0; i
< GROUP_KEEP_LIBS
- 1; i
++)
820 watermark_set(gi
->lib
[i
]);
821 watermark_set(avoid
);
823 foreach_in_group(board
, group
) {
825 foreach_neighbor(board
, coord2
, {
826 if (board_at(board
, c
) + watermark_get(c
) != S_NONE
)
829 gi
->lib
[gi
->libs
++] = c
;
830 if (unlikely(gi
->libs
>= GROUP_KEEP_LIBS
))
833 } foreach_in_group_end
;
839 board_group_rmlib(struct board
*board
, group_t group
, coord_t coord
)
842 fprintf(stderr
, "Group %d[%s] %d: Removing liberty %s\n",
843 group_base(group
), coord2sstr(group_base(group
), board
),
844 board_group_info(board
, group
).libs
, coord2sstr(coord
, board
));
847 struct group
*gi
= &board_group_info(board
, group
);
848 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++) {
850 /* Seems extra branch just slows it down */
854 if (likely(gi
->lib
[i
] != coord
))
857 coord_t lib
= gi
->lib
[i
] = gi
->lib
[--gi
->libs
];
858 gi
->lib
[gi
->libs
] = 0;
860 check_libs_consistency(board
, group
);
862 /* Postpone refilling lib[] until we need to. */
863 assert(GROUP_REFILL_LIBS
> 1);
864 if (gi
->libs
> GROUP_REFILL_LIBS
)
866 if (gi
->libs
== GROUP_REFILL_LIBS
)
867 board_group_find_extra_libs(board
, group
, gi
, coord
);
870 board_atariable_add(board
, group
, gi
->lib
[0], gi
->lib
[1]);
871 } else if (gi
->libs
== 1) {
872 board_capturable_add(board
, group
, gi
->lib
[0]);
873 board_atariable_rm(board
, group
, gi
->lib
[0], lib
);
874 } else if (gi
->libs
== 0)
875 board_capturable_rm(board
, group
, lib
);
879 /* This is ok even if gi->libs < GROUP_KEEP_LIBS since we
880 * can call this multiple times per coord. */
881 check_libs_consistency(board
, group
);
886 /* This is a low-level routine that doesn't maintain consistency
887 * of all the board data structures. */
889 board_remove_stone(struct board
*board
, group_t group
, coord_t c
)
891 enum stone color
= board_at(board
, c
);
892 board_at(board
, c
) = S_NONE
;
893 group_at(board
, c
) = 0;
894 board_hash_update(board
, c
, color
);
896 /* We mark as cannot-capture now. If this is a ko/snapback,
897 * we will get incremented later in board_group_addlib(). */
898 trait_at(board
, c
, S_BLACK
).cap
= 0;
899 trait_at(board
, c
, S_WHITE
).cap
= 0;
900 board_trait_queue(board
, c
);
903 /* Increase liberties of surrounding groups */
905 foreach_neighbor(board
, coord
, {
906 dec_neighbor_count_at(board
, c
, color
);
907 board_trait_queue(board
, c
);
908 group_t g
= group_at(board
, c
);
910 board_group_addlib(board
, g
, coord
);
914 fprintf(stderr
, "pushing free move [%d]: %d,%d\n", board
->flen
, coord_x(c
, board
), coord_y(c
, board
));
915 board
->f
[board
->flen
++] = c
;
918 static int profiling_noinline
919 board_group_capture(struct board
*board
, group_t group
)
923 foreach_in_group(board
, group
) {
924 board
->captures
[stone_other(board_at(board
, c
))]++;
925 board_remove_stone(board
, group
, c
);
927 } foreach_in_group_end
;
929 struct group
*gi
= &board_group_info(board
, group
);
931 board_atariable_rm(board
, group
, gi
->lib
[0], gi
->lib
[1]);
932 else if (gi
->libs
== 1)
933 board_capturable_rm(board
, group
, gi
->lib
[0]);
934 memset(gi
, 0, sizeof(*gi
));
940 static void profiling_noinline
941 add_to_group(struct board
*board
, group_t group
, coord_t prevstone
, coord_t coord
)
943 group_at(board
, coord
) = group
;
944 groupnext_at(board
, coord
) = groupnext_at(board
, prevstone
);
945 groupnext_at(board
, prevstone
) = coord
;
948 if (board_group_info(board
, group
).libs
== 1) {
949 /* Our group is temporarily in atari; make sure the capturable
950 * counts also correspond to the newly added stone before we
951 * start adding liberties again so bump-dump ops match. */
952 enum stone capturing_color
= stone_other(board_at(board
, group
));
953 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
954 coord_t lib
= board_group_info(board
, group
).lib
[0];
955 if (coord_is_adjecent(lib
, coord
, board
)) {
956 if (DEBUGL(8)) fprintf(stderr
, "add_to_group %s: %s[%d] bump\n", coord2sstr(group
, board
), coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
);
957 trait_at(board
, lib
, capturing_color
).cap
++;
958 board_trait_queue(board
, lib
);
963 foreach_neighbor(board
, coord
, {
964 if (board_at(board
, c
) == S_NONE
)
965 board_group_addlib(board
, group
, c
);
969 fprintf(stderr
, "add_to_group: added (%d,%d ->) %d,%d (-> %d,%d) to group %d\n",
970 coord_x(prevstone
, board
), coord_y(prevstone
, board
),
971 coord_x(coord
, board
), coord_y(coord
, board
),
972 groupnext_at(board
, coord
) % board_size(board
), groupnext_at(board
, coord
) / board_size(board
),
976 static void profiling_noinline
977 merge_groups(struct board
*board
, group_t group_to
, group_t group_from
)
980 fprintf(stderr
, "board_play_raw: merging groups %d -> %d\n",
981 group_base(group_from
), group_base(group_to
));
982 struct group
*gi_from
= &board_group_info(board
, group_from
);
983 struct group
*gi_to
= &board_group_info(board
, group_to
);
985 /* We do this early before the group info is rewritten. */
986 if (gi_from
->libs
== 2)
987 board_atariable_rm(board
, group_from
, gi_from
->lib
[0], gi_from
->lib
[1]);
988 else if (gi_from
->libs
== 1)
989 board_capturable_rm(board
, group_from
, gi_from
->lib
[0]);
992 fprintf(stderr
,"---- (froml %d, tol %d)\n", gi_from
->libs
, gi_to
->libs
);
994 if (gi_to
->libs
< GROUP_KEEP_LIBS
) {
995 for (int i
= 0; i
< gi_from
->libs
; i
++) {
996 for (int j
= 0; j
< gi_to
->libs
; j
++)
997 if (gi_to
->lib
[j
] == gi_from
->lib
[i
])
999 if (gi_to
->libs
== 0) {
1000 board_capturable_add(board
, group_to
, gi_from
->lib
[i
]);
1001 } else if (gi_to
->libs
== 1) {
1002 board_capturable_rm(board
, group_to
, gi_to
->lib
[0]);
1003 board_atariable_add(board
, group_to
, gi_to
->lib
[0], gi_from
->lib
[i
]);
1004 } else if (gi_to
->libs
== 2) {
1005 board_atariable_rm(board
, group_to
, gi_to
->lib
[0], gi_to
->lib
[1]);
1007 gi_to
->lib
[gi_to
->libs
++] = gi_from
->lib
[i
];
1008 if (gi_to
->libs
>= GROUP_KEEP_LIBS
)
1015 if (board_group_info(board
, group_to
).libs
== 1) {
1016 /* Our group is currently in atari; make sure we properly
1017 * count in even the neighbors from the other group in the
1018 * capturable counter. */
1019 enum stone capturing_color
= stone_other(board_at(board
, group_to
));
1020 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
1021 coord_t lib
= board_group_info(board
, group_to
).lib
[0];
1022 foreach_neighbor(board
, lib
, {
1023 if (DEBUGL(8) && group_at(board
, c
) == group_from
) fprintf(stderr
, "%s[%d] cap bump\n", coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
);
1024 trait_at(board
, lib
, capturing_color
).cap
+= (group_at(board
, c
) == group_from
);
1026 board_trait_queue(board
, lib
);
1030 coord_t last_in_group
;
1031 foreach_in_group(board
, group_from
) {
1033 group_at(board
, c
) = group_to
;
1034 } foreach_in_group_end
;
1035 groupnext_at(board
, last_in_group
) = groupnext_at(board
, group_base(group_to
));
1036 groupnext_at(board
, group_base(group_to
)) = group_base(group_from
);
1037 memset(gi_from
, 0, sizeof(struct group
));
1040 fprintf(stderr
, "board_play_raw: merged group: %d\n",
1041 group_base(group_to
));
1044 static group_t profiling_noinline
1045 new_group(struct board
*board
, coord_t coord
)
1047 group_t group
= coord
;
1048 struct group
*gi
= &board_group_info(board
, group
);
1049 foreach_neighbor(board
, coord
, {
1050 if (board_at(board
, c
) == S_NONE
)
1051 /* board_group_addlib is ridiculously expensive for us */
1052 #if GROUP_KEEP_LIBS < 4
1053 if (gi
->libs
< GROUP_KEEP_LIBS
)
1055 gi
->lib
[gi
->libs
++] = c
;
1058 group_at(board
, coord
) = group
;
1059 groupnext_at(board
, coord
) = 0;
1062 board_atariable_add(board
, group
, gi
->lib
[0], gi
->lib
[1]);
1063 else if (gi
->libs
== 1)
1064 board_capturable_add(board
, group
, gi
->lib
[0]);
1065 check_libs_consistency(board
, group
);
1068 fprintf(stderr
, "new_group: added %d,%d to group %d\n",
1069 coord_x(coord
, board
), coord_y(coord
, board
),
1075 static inline group_t
1076 play_one_neighbor(struct board
*board
,
1077 coord_t coord
, enum stone color
, enum stone other_color
,
1078 coord_t c
, group_t group
)
1080 enum stone ncolor
= board_at(board
, c
);
1081 group_t ngroup
= group_at(board
, c
);
1083 inc_neighbor_count_at(board
, c
, color
);
1084 /* We can be S_NONE, in that case we need to update the safety
1085 * trait since we might be left with only one liberty. */
1086 board_trait_queue(board
, c
);
1091 board_group_rmlib(board
, ngroup
, coord
);
1093 fprintf(stderr
, "board_play_raw: reducing libs for group %d (%d:%d,%d)\n",
1094 group_base(ngroup
), ncolor
, color
, other_color
);
1096 if (ncolor
== color
&& ngroup
!= group
) {
1099 add_to_group(board
, group
, c
, coord
);
1101 merge_groups(board
, group
, ngroup
);
1103 } else if (ncolor
== other_color
) {
1105 struct group
*gi
= &board_group_info(board
, ngroup
);
1106 fprintf(stderr
, "testing captured group %d[%s]: ", group_base(ngroup
), coord2sstr(group_base(ngroup
), board
));
1107 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++)
1108 fprintf(stderr
, "%s ", coord2sstr(gi
->lib
[i
], board
));
1109 fprintf(stderr
, "\n");
1111 if (unlikely(board_group_captured(board
, ngroup
)))
1112 board_group_capture(board
, ngroup
);
1117 /* We played on a place with at least one liberty. We will become a member of
1118 * some group for sure. */
1119 static group_t profiling_noinline
1120 board_play_outside(struct board
*board
, struct move
*m
, int f
)
1122 coord_t coord
= m
->coord
;
1123 enum stone color
= m
->color
;
1124 enum stone other_color
= stone_other(color
);
1127 board
->f
[f
] = board
->f
[--board
->flen
];
1129 fprintf(stderr
, "popping free move [%d->%d]: %d\n", board
->flen
, f
, board
->f
[f
]);
1131 #if defined(BOARD_TRAITS) && defined(DEBUG)
1132 /* Sanity check that cap matches reality. */
1135 foreach_neighbor(board
, coord
, {
1136 group_t g
= group_at(board
, c
);
1137 a
+= g
&& (board_at(board
, c
) == other_color
&& board_group_info(board
, g
).libs
== 1);
1139 assert(a
== trait_at(board
, coord
, color
).cap
);
1140 assert(board_trait_safe(board
, coord
, color
) == trait_at(board
, coord
, color
).safe
);
1143 foreach_neighbor(board
, coord
, {
1144 group
= play_one_neighbor(board
, coord
, color
, other_color
, c
, group
);
1147 board_at(board
, coord
) = color
;
1148 if (unlikely(!group
))
1149 group
= new_group(board
, coord
);
1150 board_gamma_update(board
, coord
, S_BLACK
);
1151 board_gamma_update(board
, coord
, S_WHITE
);
1153 board
->last_move2
= board
->last_move
;
1154 board
->last_move
= *m
;
1156 board_hash_update(board
, coord
, color
);
1157 board_symmetry_update(board
, &board
->symmetry
, coord
);
1158 struct move ko
= { pass
, S_NONE
};
1164 /* We played in an eye-like shape. Either we capture at least one of the eye
1165 * sides in the process of playing, or return -1. */
1166 static int profiling_noinline
1167 board_play_in_eye(struct board
*board
, struct move
*m
, int f
)
1169 coord_t coord
= m
->coord
;
1170 enum stone color
= m
->color
;
1171 /* Check ko: Capture at a position of ko capture one move ago */
1172 if (unlikely(color
== board
->ko
.color
&& coord
== board
->ko
.coord
)) {
1174 fprintf(stderr
, "board_check: ko at %d,%d color %d\n", coord_x(coord
, board
), coord_y(coord
, board
), color
);
1176 } else if (DEBUGL(6)) {
1177 fprintf(stderr
, "board_check: no ko at %d,%d,%d - ko is %d,%d,%d\n",
1178 color
, coord_x(coord
, board
), coord_y(coord
, board
),
1179 board
->ko
.color
, coord_x(board
->ko
.coord
, board
), coord_y(board
->ko
.coord
, board
));
1182 struct move ko
= { pass
, S_NONE
};
1184 int captured_groups
= 0;
1186 foreach_neighbor(board
, coord
, {
1187 group_t g
= group_at(board
, c
);
1189 fprintf(stderr
, "board_check: group %d has %d libs\n",
1190 g
, board_group_info(board
, g
).libs
);
1191 captured_groups
+= (board_group_info(board
, g
).libs
== 1);
1194 if (likely(captured_groups
== 0)) {
1197 board_print(board
, stderr
);
1198 fprintf(stderr
, "board_check: one-stone suicide\n");
1204 /* We _will_ for sure capture something. */
1205 assert(trait_at(board
, coord
, color
).cap
> 0);
1206 assert(trait_at(board
, coord
, color
).safe
== board_trait_safe(board
, coord
, color
));
1209 board
->f
[f
] = board
->f
[--board
->flen
];
1211 fprintf(stderr
, "popping free move [%d->%d]: %d\n", board
->flen
, f
, board
->f
[f
]);
1213 foreach_neighbor(board
, coord
, {
1214 inc_neighbor_count_at(board
, c
, color
);
1215 /* Originally, this could not have changed any trait
1216 * since no neighbors were S_NONE, however by now some
1217 * of them might be removed from the board. */
1218 board_trait_queue(board
, c
);
1220 group_t group
= group_at(board
, c
);
1224 board_group_rmlib(board
, group
, coord
);
1226 fprintf(stderr
, "board_play_raw: reducing libs for group %d\n",
1229 if (board_group_captured(board
, group
)) {
1230 if (board_group_capture(board
, group
) == 1) {
1231 /* If we captured multiple groups at once,
1232 * we can't be fighting ko so we don't need
1233 * to check for that. */
1234 ko
.color
= stone_other(color
);
1236 board
->last_ko
= ko
;
1237 board
->last_ko_age
= board
->moves
;
1239 fprintf(stderr
, "guarding ko at %d,%s\n", ko
.color
, coord2sstr(ko
.coord
, board
));
1244 board_at(board
, coord
) = color
;
1245 group_t group
= new_group(board
, coord
);
1246 board_gamma_update(board
, coord
, S_BLACK
);
1247 board_gamma_update(board
, coord
, S_WHITE
);
1249 board
->last_move2
= board
->last_move
;
1250 board
->last_move
= *m
;
1252 board_hash_update(board
, coord
, color
);
1253 board_hash_commit(board
);
1254 board_traits_recompute(board
);
1255 board_symmetry_update(board
, &board
->symmetry
, coord
);
1261 static int __attribute__((flatten
))
1262 board_play_f(struct board
*board
, struct move
*m
, int f
)
1265 fprintf(stderr
, "board_play(): ---- Playing %d,%d\n", coord_x(m
->coord
, board
), coord_y(m
->coord
, board
));
1267 if (likely(!board_is_eyelike(board
, m
->coord
, stone_other(m
->color
)))) {
1268 /* NOT playing in an eye. Thus this move has to succeed. (This
1269 * is thanks to New Zealand rules. Otherwise, multi-stone
1270 * suicide might fail.) */
1271 group_t group
= board_play_outside(board
, m
, f
);
1272 if (unlikely(board_group_captured(board
, group
))) {
1273 board_group_capture(board
, group
);
1275 board_hash_commit(board
);
1276 board_traits_recompute(board
);
1279 return board_play_in_eye(board
, m
, f
);
1284 board_play(struct board
*board
, struct move
*m
)
1286 if (unlikely(is_pass(m
->coord
) || is_resign(m
->coord
))) {
1287 struct move nomove
= { pass
, S_NONE
};
1289 board
->last_move2
= board
->last_move
;
1290 board
->last_move
= *m
;
1295 for (f
= 0; f
< board
->flen
; f
++)
1296 if (board
->f
[f
] == m
->coord
)
1297 return board_play_f(board
, m
, f
);
1300 fprintf(stderr
, "board_check: stone exists\n");
1306 board_try_random_move(struct board
*b
, enum stone color
, coord_t
*coord
, int f
, ppr_permit permit
, void *permit_data
)
1309 struct move m
= { *coord
, color
};
1311 fprintf(stderr
, "trying random move %d: %d,%d\n", f
, coord_x(*coord
, b
), coord_y(*coord
, b
));
1312 if (unlikely(board_is_one_point_eye(b
, *coord
, color
)) /* bad idea to play into one, usually */
1313 || !board_is_valid_move(b
, &m
)
1314 || (permit
&& !permit(permit_data
, b
, &m
)))
1316 *coord
= m
.coord
; // permit might modify it
1317 return likely(board_play_f(b
, &m
, f
) >= 0);
1321 board_play_random(struct board
*b
, enum stone color
, coord_t
*coord
, ppr_permit permit
, void *permit_data
)
1323 if (unlikely(b
->flen
== 0))
1326 int base
= fast_random(b
->flen
), f
;
1327 for (f
= base
; f
< b
->flen
; f
++)
1328 if (board_try_random_move(b
, color
, coord
, f
, permit
, permit_data
))
1330 for (f
= 0; f
< base
; f
++)
1331 if (board_try_random_move(b
, color
, coord
, f
, permit
, permit_data
))
1336 struct move m
= { pass
, color
};
1342 board_is_false_eyelike(struct board
*board
, coord_t coord
, enum stone eye_color
)
1344 enum stone color_diag_libs
[S_MAX
] = {0, 0, 0, 0};
1346 /* XXX: We attempt false eye detection but we will yield false
1347 * positives in case of http://senseis.xmp.net/?TwoHeadedDragon :-( */
1349 foreach_diag_neighbor(board
, coord
) {
1350 color_diag_libs
[(enum stone
) board_at(board
, c
)]++;
1351 } foreach_diag_neighbor_end
;
1352 /* For false eye, we need two enemy stones diagonally in the
1353 * middle of the board, or just one enemy stone at the edge
1354 * or in the corner. */
1355 color_diag_libs
[stone_other(eye_color
)] += !!color_diag_libs
[S_OFFBOARD
];
1356 return color_diag_libs
[stone_other(eye_color
)] >= 2;
1360 board_is_one_point_eye(struct board
*board
, coord_t coord
, enum stone eye_color
)
1362 return board_is_eyelike(board
, coord
, eye_color
)
1363 && !board_is_false_eyelike(board
, coord
, eye_color
);
1367 board_get_one_point_eye(struct board
*board
, coord_t coord
)
1369 if (board_is_one_point_eye(board
, coord
, S_WHITE
))
1371 else if (board_is_one_point_eye(board
, coord
, S_BLACK
))
1379 board_fast_score(struct board
*board
)
1382 memset(scores
, 0, sizeof(scores
));
1384 foreach_point(board
) {
1385 enum stone color
= board_at(board
, c
);
1386 if (color
== S_NONE
)
1387 color
= board_get_one_point_eye(board
, c
);
1389 // fprintf(stderr, "%d, %d ++%d = %d\n", coord_x(c, board), coord_y(c, board), color, scores[color]);
1390 } foreach_point_end
;
1392 return board
->komi
+ board
->handicap
+ scores
[S_WHITE
] - scores
[S_BLACK
];
1395 /* Owner map: 0: undecided; 1: black; 2: white; 3: dame */
1397 /* One flood-fill iteration; returns true if next iteration
1400 board_tromp_taylor_iter(struct board
*board
, int *ownermap
)
1402 bool needs_update
= false;
1403 foreach_point(board
) {
1404 /* Ignore occupied and already-dame positions. */
1405 if (board_at(board
, c
) != S_NONE
|| ownermap
[c
] == 3)
1407 /* Count neighbors. */
1409 foreach_neighbor(board
, c
, {
1412 /* If we have neighbors of both colors, or dame,
1413 * we are dame too. */
1414 if ((nei
[1] && nei
[2]) || nei
[3]) {
1416 /* Speed up the propagation. */
1417 foreach_neighbor(board
, c
, {
1418 if (board_at(board
, c
) == S_NONE
)
1421 needs_update
= true;
1424 /* If we have neighbors of one color, we are owned
1425 * by that color, too. */
1426 if (!ownermap
[c
] && (nei
[1] || nei
[2])) {
1427 int newowner
= nei
[1] ? 1 : 2;
1428 ownermap
[c
] = newowner
;
1429 /* Speed up the propagation. */
1430 foreach_neighbor(board
, c
, {
1431 if (board_at(board
, c
) == S_NONE
&& !ownermap
[c
])
1432 ownermap
[c
] = newowner
;
1434 needs_update
= true;
1437 } foreach_point_end
;
1438 return needs_update
;
1441 /* Tromp-Taylor Counting */
1443 board_official_score(struct board
*board
, struct move_queue
*q
)
1446 /* A point P, not colored C, is said to reach C, if there is a path of
1447 * (vertically or horizontally) adjacent points of P's color from P to
1448 * a point of color C.
1450 * A player's score is the number of points of her color, plus the
1451 * number of empty points that reach only her color. */
1453 int ownermap
[board_size2(board
)];
1455 const int o
[4] = {0, 1, 2, 0};
1456 foreach_point(board
) {
1457 ownermap
[c
] = o
[board_at(board
, c
)];
1458 s
[board_at(board
, c
)]++;
1459 } foreach_point_end
;
1462 /* Process dead groups. */
1463 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
1464 foreach_in_group(board
, q
->move
[i
]) {
1465 enum stone color
= board_at(board
, c
);
1466 ownermap
[c
] = o
[stone_other(color
)];
1467 s
[color
]--; s
[stone_other(color
)]++;
1468 } foreach_in_group_end
;
1472 /* We need to special-case empty board. */
1473 if (!s
[S_BLACK
] && !s
[S_WHITE
])
1474 return board
->komi
+ board
->handicap
;
1476 while (board_tromp_taylor_iter(board
, ownermap
))
1477 /* Flood-fill... */;
1480 memset(scores
, 0, sizeof(scores
));
1482 foreach_point(board
) {
1483 assert(board_at(board
, c
) == S_OFFBOARD
|| ownermap
[c
] != 0);
1484 if (ownermap
[c
] == 3)
1486 scores
[ownermap
[c
]]++;
1487 } foreach_point_end
;
1489 return board
->komi
+ board
->handicap
+ scores
[S_WHITE
] - scores
[S_BLACK
];