15 #include "patternsp.h"
21 static void board_trait_recompute(struct board
*board
, coord_t coord
);
30 #define profiling_noinline __attribute__((noinline))
32 #define profiling_noinline
35 #define gi_granularity 4
36 #define gi_allocsize(gids) ((1 << gi_granularity) + ((gids) >> gi_granularity) * (1 << gi_granularity))
40 board_setup(struct board
*b
)
42 memset(b
, 0, sizeof(*b
));
44 struct move m
= { pass
, S_NONE
};
45 b
->last_move
= b
->last_move2
= b
->last_ko
= b
->ko
= m
;
51 struct board
*b
= malloc2(sizeof(struct board
));
62 board_alloc(struct board
*board
)
64 /* We do not allocate the board structure itself but we allocate
65 * all the arrays with board contents. */
67 int bsize
= board_size2(board
) * sizeof(*board
->b
);
68 int gsize
= board_size2(board
) * sizeof(*board
->g
);
69 int fsize
= board_size2(board
) * sizeof(*board
->f
);
70 int nsize
= board_size2(board
) * sizeof(*board
->n
);
71 int psize
= board_size2(board
) * sizeof(*board
->p
);
72 int hsize
= board_size2(board
) * 2 * sizeof(*board
->h
);
73 int gisize
= board_size2(board
) * sizeof(*board
->gi
);
75 int csize
= board_size2(board
) * sizeof(*board
->c
);
80 int ssize
= board_size2(board
) * sizeof(*board
->spathash
);
85 int p3size
= board_size2(board
) * sizeof(*board
->pat3
);
90 int tsize
= board_size2(board
) * sizeof(*board
->t
);
91 int tqsize
= board_size2(board
) * sizeof(*board
->t
);
97 int pbsize
= board_size2(board
) * sizeof(*board
->prob
[0].items
);
98 int rowpbsize
= board_size(board
) * sizeof(*board
->prob
[0].rowtotals
);
103 int cdsize
= board_size2(board
) * sizeof(*board
->coord
);
105 size_t size
= bsize
+ gsize
+ fsize
+ psize
+ nsize
+ hsize
+ gisize
+ csize
+ ssize
+ p3size
+ tsize
+ tqsize
+ (pbsize
+ rowpbsize
) * 2 + cdsize
;
106 void *x
= malloc2(size
);
108 /* board->b must come first */
109 board
->b
= x
; x
+= bsize
;
110 board
->g
= x
; x
+= gsize
;
111 board
->f
= x
; x
+= fsize
;
112 board
->p
= x
; x
+= psize
;
113 board
->n
= x
; x
+= nsize
;
114 board
->h
= x
; x
+= hsize
;
115 board
->gi
= x
; x
+= gisize
;
117 board
->c
= x
; x
+= csize
;
119 #ifdef BOARD_SPATHASH
120 board
->spathash
= x
; x
+= ssize
;
123 board
->pat3
= x
; x
+= p3size
;
126 board
->t
= x
; x
+= tsize
;
127 board
->tq
= x
; x
+= tqsize
;
130 board
->prob
[0].items
= x
; x
+= pbsize
;
131 board
->prob
[1].items
= x
; x
+= pbsize
;
132 board
->prob
[0].rowtotals
= x
; x
+= rowpbsize
;
133 board
->prob
[1].rowtotals
= x
; x
+= rowpbsize
;
135 board
->coord
= x
; x
+= cdsize
;
141 board_copy(struct board
*b2
, struct board
*b1
)
143 memcpy(b2
, b1
, sizeof(struct board
));
145 size_t size
= board_alloc(b2
);
146 memcpy(b2
->b
, b1
->b
, size
);
152 board_done_noalloc(struct board
*board
)
154 if (board
->b
) free(board
->b
);
158 board_done(struct board
*board
)
160 board_done_noalloc(board
);
165 board_resize(struct board
*board
, int size
)
168 assert(board_size(board
) == size
+ 2);
170 board
->size
= size
+ 2 /* S_OFFBOARD margin */;
171 board
->size2
= board_size(board
) * board_size(board
);
174 while ((1 << board
->bits2
) < board
->size2
) board
->bits2
++;
179 size_t asize
= board_alloc(board
);
180 memset(board
->b
, 0, asize
);
184 board_clear(struct board
*board
)
186 int size
= board_size(board
);
187 float komi
= board
->komi
;
189 board_done_noalloc(board
);
191 board_resize(board
, size
- 2 /* S_OFFBOARD margin */);
195 /* Setup neighborhood iterators */
196 board
->nei8
[0] = -size
- 1; // (-1,-1)
199 board
->nei8
[3] = size
- 2; // (-1,0)
201 board
->nei8
[5] = size
- 2; // (-1,1)
204 board
->dnei
[0] = -size
- 1;
206 board
->dnei
[2] = size
*2 - 2;
209 /* Setup initial symmetry */
210 board
->symmetry
.d
= 1;
211 board
->symmetry
.x1
= board
->symmetry
.y1
= board_size(board
) / 2;
212 board
->symmetry
.x2
= board
->symmetry
.y2
= board_size(board
) - 1;
213 board
->symmetry
.type
= SYM_FULL
;
215 /* Set up coordinate cache */
216 foreach_point(board
) {
217 board
->coord
[c
][0] = c
% board_size(board
);
218 board
->coord
[c
][1] = c
/ board_size(board
);
221 /* Draw the offboard margin */
222 int top_row
= board_size2(board
) - board_size(board
);
224 for (i
= 0; i
< board_size(board
); i
++)
225 board
->b
[i
] = board
->b
[top_row
+ i
] = S_OFFBOARD
;
226 for (i
= 0; i
<= top_row
; i
+= board_size(board
))
227 board
->b
[i
] = board
->b
[board_size(board
) - 1 + i
] = S_OFFBOARD
;
229 foreach_point(board
) {
231 if (board_at(board
, coord
) == S_OFFBOARD
)
233 foreach_neighbor(board
, c
, {
234 inc_neighbor_count_at(board
, coord
, board_at(board
, c
));
238 /* All positions are free! Except the margin. */
239 for (i
= board_size(board
); i
< (board_size(board
) - 1) * board_size(board
); i
++)
240 if (i
% board_size(board
) != 0 && i
% board_size(board
) != board_size(board
) - 1)
241 board
->f
[board
->flen
++] = i
;
243 /* Initialize zobrist hashtable. */
244 foreach_point(board
) {
245 int max
= (sizeof(hash_t
) << history_hash_bits
);
246 /* fast_random() is 16-bit only */
247 board
->h
[c
* 2] = ((hash_t
) fast_random(max
))
248 | ((hash_t
) fast_random(max
) << 16)
249 | ((hash_t
) fast_random(max
) << 32)
250 | ((hash_t
) fast_random(max
) << 48);
251 if (!board
->h
[c
* 2])
252 /* Would be kinda "oops". */
254 /* And once again for white */
255 board
->h
[c
* 2 + 1] = ((hash_t
) fast_random(max
))
256 | ((hash_t
) fast_random(max
) << 16)
257 | ((hash_t
) fast_random(max
) << 32)
258 | ((hash_t
) fast_random(max
) << 48);
259 if (!board
->h
[c
* 2 + 1])
260 board
->h
[c
* 2 + 1] = 1;
263 #ifdef BOARD_SPATHASH
264 /* Initialize spatial hashes. */
265 foreach_point(board
) {
266 for (int d
= 1; d
<= BOARD_SPATHASH_MAXD
; d
++) {
267 for (int j
= ptind
[d
]; j
< ptind
[d
+ 1]; j
++) {
268 ptcoords_at(x
, y
, c
, board
, j
);
269 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][0] ^=
270 pthashes
[0][j
][board_at(board
, c
)];
271 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][1] ^=
272 pthashes
[0][j
][stone_other(board_at(board
, c
))];
278 /* Initialize 3x3 pattern codes. */
279 foreach_point(board
) {
280 if (board_at(board
, c
) == S_NONE
)
281 board
->pat3
[c
] = pattern3_hash(board
, c
);
285 /* Initialize traits. */
286 foreach_point(board
) {
287 trait_at(board
, c
, S_BLACK
).cap
= 0;
288 trait_at(board
, c
, S_BLACK
).cap1
= 0;
289 trait_at(board
, c
, S_BLACK
).safe
= true;
290 trait_at(board
, c
, S_WHITE
).cap
= 0;
291 trait_at(board
, c
, S_WHITE
).cap1
= 0;
292 trait_at(board
, c
, S_WHITE
).safe
= true;
296 board
->prob
[0].b
= board
->prob
[1].b
= board
;
297 foreach_point(board
) {
298 probdist_set(&board
->prob
[0], c
, double_to_fixp((board_at(board
, c
) == S_NONE
) * 1.0f
));
299 probdist_set(&board
->prob
[1], c
, double_to_fixp((board_at(board
, c
) == S_NONE
) * 1.0f
));
305 board_print_top(struct board
*board
, char *s
, char *end
, int c
)
307 for (int i
= 0; i
< c
; i
++) {
308 char asdf
[] = "ABCDEFGHJKLMNOPQRSTUVWXYZ";
309 s
+= snprintf(s
, end
- s
, " ");
310 for (int x
= 1; x
< board_size(board
) - 1; x
++)
311 s
+= snprintf(s
, end
- s
, "%c ", asdf
[x
- 1]);
312 s
+= snprintf(s
, end
-s
, " ");
314 s
+= snprintf(s
, end
- s
, "\n");
315 for (int i
= 0; i
< c
; i
++) {
316 s
+= snprintf(s
, end
- s
, " +-");
317 for (int x
= 1; x
< board_size(board
) - 1; x
++)
318 s
+= snprintf(s
, end
- s
, "--");
319 s
+= snprintf(s
, end
- s
, "+");
321 s
+= snprintf(s
, end
- s
, "\n");
326 board_print_bottom(struct board
*board
, char *s
, char *end
, int c
)
328 for (int i
= 0; i
< c
; i
++) {
329 s
+= snprintf(s
, end
- s
, " +-");
330 for (int x
= 1; x
< board_size(board
) - 1; x
++)
331 s
+= snprintf(s
, end
- s
, "--");
332 s
+= snprintf(s
, end
- s
, "+");
334 s
+= snprintf(s
, end
- s
, "\n");
339 board_print_row(struct board
*board
, int y
, char *s
, char *end
, board_cprint cprint
)
341 s
+= snprintf(s
, end
- s
, " %2d | ", y
);
342 for (int x
= 1; x
< board_size(board
) - 1; x
++) {
343 if (coord_x(board
->last_move
.coord
, board
) == x
&& coord_y(board
->last_move
.coord
, board
) == y
)
344 s
+= snprintf(s
, end
- s
, "%c)", stone2char(board_atxy(board
, x
, y
)));
346 s
+= snprintf(s
, end
- s
, "%c ", stone2char(board_atxy(board
, x
, y
)));
348 s
+= snprintf(s
, end
- s
, "|");
350 s
+= snprintf(s
, end
- s
, " %2d | ", y
);
351 for (int x
= 1; x
< board_size(board
) - 1; x
++) {
352 s
= cprint(board
, coord_xy(board
, x
, y
), s
, end
);
354 s
+= snprintf(s
, end
- s
, "|");
356 s
+= snprintf(s
, end
- s
, "\n");
361 board_print_custom(struct board
*board
, FILE *f
, board_cprint cprint
)
365 char *end
= buf
+ sizeof(buf
);
366 s
+= snprintf(s
, end
- s
, "Move: % 3d Komi: %2.1f Handicap: %d Captures B: %d W: %d\n",
367 board
->moves
, board
->komi
, board
->handicap
,
368 board
->captures
[S_BLACK
], board
->captures
[S_WHITE
]);
369 s
= board_print_top(board
, s
, end
, 1 + !!cprint
);
370 for (int y
= board_size(board
) - 2; y
>= 1; y
--)
371 s
= board_print_row(board
, y
, s
, end
, cprint
);
372 board_print_bottom(board
, s
, end
, 1 + !!cprint
);
373 fprintf(f
, "%s\n", buf
);
377 cprint_group(struct board
*board
, coord_t c
, char *s
, char *end
)
379 s
+= snprintf(s
, end
- s
, "%d ", group_base(group_at(board
, c
)));
384 board_print(struct board
*board
, FILE *f
)
386 board_print_custom(board
, f
, DEBUGL(6) ? cprint_group
: NULL
);
390 board_gamma_set(struct board
*b
, struct features_gamma
*gamma
, bool precise_selfatari
)
394 b
->precise_selfatari
= precise_selfatari
;
395 for (int i
= 0; i
< b
->flen
; i
++) {
396 board_trait_recompute(b
, b
->f
[i
]);
402 /* Update the probability distribution we maintain incrementally. */
404 board_gamma_update(struct board
*board
, coord_t coord
, enum stone color
)
410 /* Punch out invalid moves and moves filling our own eyes. */
411 if (board_at(board
, coord
) != S_NONE
412 || (board_is_eyelike(board
, coord
, stone_other(color
))
413 && !trait_at(board
, coord
, color
).cap
)
414 || (board_is_one_point_eye(board
, coord
, color
))) {
415 probdist_set(&board
->prob
[color
- 1], coord
, 0);
419 hash3_t pat
= board
->pat3
[coord
];
420 if (color
== S_WHITE
) {
421 /* We work with the pattern3s as black-to-play. */
422 pat
= pattern3_reverse(pat
);
425 /* We just quickly replicate the general pattern matcher stuff
426 * here in the most bare-bone way. */
427 double value
= board
->gamma
->gamma
[FEAT_PATTERN3
][pat
];
428 if (trait_at(board
, coord
, color
).cap
) {
430 i
|= (trait_at(board
, coord
, color
).cap1
== trait_at(board
, coord
, color
).cap
) << PF_CAPTURE_1STONE
;
431 i
|= (!trait_at(board
, coord
, stone_other(color
)).safe
) << PF_CAPTURE_TRAPPED
;
432 value
*= board
->gamma
->gamma
[FEAT_CAPTURE
][i
];
434 if (trait_at(board
, coord
, stone_other(color
)).cap
) {
436 i
|= (trait_at(board
, coord
, stone_other(color
)).cap1
== trait_at(board
, coord
, stone_other(color
)).cap
) << PF_AESCAPE_1STONE
;
437 i
|= (!trait_at(board
, coord
, color
).safe
) << PF_AESCAPE_TRAPPED
;
438 value
*= board
->gamma
->gamma
[FEAT_AESCAPE
][i
];
440 if (!trait_at(board
, coord
, color
).safe
)
441 value
*= board
->gamma
->gamma
[FEAT_SELFATARI
][1 + board
->precise_selfatari
];
442 probdist_set(&board
->prob
[color
- 1], coord
, double_to_fixp(value
));
448 board_trait_safe(struct board
*board
, coord_t coord
, enum stone color
)
450 if (board
->precise_selfatari
)
451 return !is_bad_selfatari(board
, color
, coord
);
453 return board_safe_to_play(board
, coord
, color
);
457 board_trait_recompute(struct board
*board
, coord_t coord
)
459 trait_at(board
, coord
, S_BLACK
).safe
= board_trait_safe(board
, coord
, S_BLACK
);;
460 trait_at(board
, coord
, S_WHITE
).safe
= board_trait_safe(board
, coord
, S_WHITE
);
462 fprintf(stderr
, "traits[%s:%s lib=%d] (black cap=%d cap1=%d safe=%d) (white cap=%d cap1=%d safe=%d)\n",
463 coord2sstr(coord
, board
), stone2str(board_at(board
, coord
)), immediate_liberty_count(board
, coord
),
464 trait_at(board
, coord
, S_BLACK
).cap
, trait_at(board
, coord
, S_BLACK
).cap1
, trait_at(board
, coord
, S_BLACK
).safe
,
465 trait_at(board
, coord
, S_WHITE
).cap
, trait_at(board
, coord
, S_WHITE
).cap1
, trait_at(board
, coord
, S_WHITE
).safe
);
467 board_gamma_update(board
, coord
, S_BLACK
);
468 board_gamma_update(board
, coord
, S_WHITE
);
472 /* Recompute traits for dirty points that we have previously touched
473 * somehow (libs of their neighbors changed or so). */
475 board_traits_recompute(struct board
*board
)
478 for (int i
= 0; i
< board
->tqlen
; i
++) {
479 coord_t coord
= board
->tq
[i
];
480 trait_at(board
, coord
, S_BLACK
).dirty
= false;
481 if (board_at(board
, coord
) != S_NONE
)
483 board_trait_recompute(board
, coord
);
489 /* Queue traits of given point for recomputing. */
491 board_trait_queue(struct board
*board
, coord_t coord
)
494 if (trait_at(board
, coord
, S_BLACK
).dirty
)
496 board
->tq
[board
->tqlen
++] = coord
;
497 trait_at(board
, coord
, S_BLACK
).dirty
= true;
502 /* Update board hash with given coordinate. */
503 static void profiling_noinline
504 board_hash_update(struct board
*board
, coord_t coord
, enum stone color
)
506 board
->hash
^= hash_at(board
, coord
, color
);
508 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
);
510 #ifdef BOARD_SPATHASH
511 /* Gridcular metric is reflective, so we update all hashes
512 * of appropriate ditance in OUR circle. */
513 for (int d
= 1; d
<= BOARD_SPATHASH_MAXD
; d
++) {
514 for (int j
= ptind
[d
]; j
< ptind
[d
+ 1]; j
++) {
515 ptcoords_at(x
, y
, coord
, board
, j
);
516 /* We either changed from S_NONE to color
517 * or vice versa; doesn't matter. */
518 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][0] ^=
519 pthashes
[0][j
][color
] ^ pthashes
[0][j
][S_NONE
];
520 board
->spathash
[coord_xy(board
, x
, y
)][d
- 1][1] ^=
521 pthashes
[0][j
][stone_other(color
)] ^ pthashes
[0][j
][S_NONE
];
526 #if defined(BOARD_PAT3)
527 /* @color is not what we need in case of capture. */
528 enum stone new_color
= board_at(board
, coord
);
529 if (new_color
== S_NONE
)
530 board
->pat3
[coord
] = pattern3_hash(board
, coord
);
531 foreach_8neighbor(board
, coord
) { // internally, the loop uses fn__i=[0..7]
532 if (board_at(board
, c
) != S_NONE
)
534 board
->pat3
[c
] &= ~(3 << (fn__i
*2));
535 board
->pat3
[c
] |= new_color
<< (fn__i
*2);
537 if (board_at(board
, c
) != S_OFFBOARD
&& pattern3_hash(board
, c
) != board
->pat3
[c
]) {
538 board_print(board
, stderr
);
539 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
);
543 board_trait_queue(board
, c
);
544 } foreach_8neighbor_end
;
548 /* Commit current board hash to history. */
549 static void profiling_noinline
550 board_hash_commit(struct board
*board
)
553 fprintf(stderr
, "board_hash_commit %"PRIhash
"\n", board
->hash
);
554 if (likely(board
->history_hash
[board
->hash
& history_hash_mask
]) == 0) {
555 board
->history_hash
[board
->hash
& history_hash_mask
] = board
->hash
;
557 hash_t i
= board
->hash
;
558 while (board
->history_hash
[i
& history_hash_mask
]) {
559 if (board
->history_hash
[i
& history_hash_mask
] == board
->hash
) {
561 fprintf(stderr
, "SUPERKO VIOLATION noted at %d,%d\n",
562 coord_x(board
->last_move
.coord
, board
), coord_y(board
->last_move
.coord
, board
));
563 board
->superko_violation
= true;
566 i
= history_hash_next(i
);
568 board
->history_hash
[i
& history_hash_mask
] = board
->hash
;
574 board_symmetry_update(struct board
*b
, struct board_symmetry
*symmetry
, coord_t c
)
576 if (likely(symmetry
->type
== SYM_NONE
)) {
577 /* Fully degenerated already. We do not support detection
578 * of restoring of symmetry, assuming that this is too rare
579 * a case to handle. */
583 int x
= coord_x(c
, b
), y
= coord_y(c
, b
), t
= board_size(b
) / 2;
584 int dx
= board_size(b
) - 1 - x
; /* for SYM_DOWN */
586 fprintf(stderr
, "SYMMETRY [%d,%d,%d,%d|%d=%d] update for %d,%d\n",
587 symmetry
->x1
, symmetry
->y1
, symmetry
->x2
, symmetry
->y2
,
588 symmetry
->d
, symmetry
->type
, x
, y
);
591 switch (symmetry
->type
) {
593 if (x
== t
&& y
== t
) {
594 /* Tengen keeps full symmetry. */
597 /* New symmetry now? */
599 symmetry
->type
= SYM_DIAG_UP
;
600 symmetry
->x1
= symmetry
->y1
= 1;
601 symmetry
->x2
= symmetry
->y2
= board_size(b
) - 1;
603 } else if (dx
== y
) {
604 symmetry
->type
= SYM_DIAG_DOWN
;
605 symmetry
->x1
= symmetry
->y1
= 1;
606 symmetry
->x2
= symmetry
->y2
= board_size(b
) - 1;
609 symmetry
->type
= SYM_HORIZ
;
611 symmetry
->y2
= board_size(b
) - 1;
614 symmetry
->type
= SYM_VERT
;
616 symmetry
->x2
= board_size(b
) - 1;
620 symmetry
->type
= SYM_NONE
;
621 symmetry
->x1
= symmetry
->y1
= 1;
622 symmetry
->x2
= symmetry
->y2
= board_size(b
) - 1;
648 fprintf(stderr
, "NEW SYMMETRY [%d,%d,%d,%d|%d=%d]\n",
649 symmetry
->x1
, symmetry
->y1
, symmetry
->x2
, symmetry
->y2
,
650 symmetry
->d
, symmetry
->type
);
657 board_handicap_stone(struct board
*board
, int x
, int y
, FILE *f
)
660 m
.color
= S_BLACK
; m
.coord
= coord_xy(board
, x
, y
);
662 board_play(board
, &m
);
663 /* Simulate white passing; otherwise, UCT search can get confused since
664 * tree depth parity won't match the color to move. */
667 char *str
= coord2str(m
.coord
, board
);
669 fprintf(stderr
, "choosing handicap %s (%d,%d)\n", str
, x
, y
);
670 if (f
) fprintf(f
, "%s ", str
);
675 board_handicap(struct board
*board
, int stones
, FILE *f
)
677 int margin
= 3 + (board_size(board
) >= 13);
679 int mid
= board_size(board
) / 2;
680 int max
= board_size(board
) - 1 - margin
;
681 const int places
[][2] = {
682 { min
, min
}, { max
, max
}, { max
, min
}, { min
, max
},
683 { min
, mid
}, { max
, mid
},
684 { mid
, min
}, { mid
, max
},
688 board
->handicap
= stones
;
690 if (stones
== 5 || stones
== 7) {
691 board_handicap_stone(board
, mid
, mid
, f
);
696 for (i
= 0; i
< stones
; i
++)
697 board_handicap_stone(board
, places
[i
][0], places
[i
][1], f
);
701 static void __attribute__((noinline
))
702 check_libs_consistency(struct board
*board
, group_t g
)
706 struct group
*gi
= &board_group_info(board
, g
);
707 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++)
708 if (gi
->lib
[i
] && board_at(board
, gi
->lib
[i
]) != S_NONE
) {
709 fprintf(stderr
, "BOGUS LIBERTY %s of group %d[%s]\n", coord2sstr(gi
->lib
[i
], board
), g
, coord2sstr(group_base(g
), board
));
716 board_capturable_add(struct board
*board
, group_t group
, coord_t lib
, bool onestone
)
718 //fprintf(stderr, "group %s cap %s\n", coord2sstr(group, board), coord2sstr(lib, boarD));
720 /* Increase capturable count trait of my last lib. */
721 enum stone capturing_color
= stone_other(board_at(board
, group
));
722 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
723 foreach_neighbor(board
, lib
, {
724 if (DEBUGL(8) && group_at(board
, c
) == group
)
725 fprintf(stderr
, "%s[%d] %s cap bump bc of %s(%d) member %s onestone %d\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
), onestone
);
726 trait_at(board
, lib
, capturing_color
).cap
+= (group_at(board
, c
) == group
);
727 trait_at(board
, lib
, capturing_color
).cap1
+= (group_at(board
, c
) == group
&& onestone
);
729 board_trait_queue(board
, lib
);
733 /* Update the list of capturable groups. */
735 assert(board
->clen
< board_size2(board
));
736 board
->c
[board
->clen
++] = group
;
740 board_capturable_rm(struct board
*board
, group_t group
, coord_t lib
, bool onestone
)
742 //fprintf(stderr, "group %s nocap %s\n", coord2sstr(group, board), coord2sstr(lib, board));
744 /* Decrease capturable count trait of my previously-last lib. */
745 enum stone capturing_color
= stone_other(board_at(board
, group
));
746 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
747 foreach_neighbor(board
, lib
, {
748 if (DEBUGL(8) && group_at(board
, c
) == group
)
749 fprintf(stderr
, "%s[%d] cap dump bc of %s(%d) member %s onestone %d\n", coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
, coord2sstr(group
, board
), board_group_info(board
, group
).libs
, coord2sstr(c
, board
), onestone
);
750 trait_at(board
, lib
, capturing_color
).cap
-= (group_at(board
, c
) == group
);
751 trait_at(board
, lib
, capturing_color
).cap1
-= (group_at(board
, c
) == group
&& onestone
);
753 board_trait_queue(board
, lib
);
757 /* Update the list of capturable groups. */
758 for (int i
= 0; i
< board
->clen
; i
++) {
759 if (unlikely(board
->c
[i
] == group
)) {
760 board
->c
[i
] = board
->c
[--board
->clen
];
764 fprintf(stderr
, "rm of bad group %d\n", group_base(group
));
770 board_atariable_add(struct board
*board
, group_t group
, coord_t lib1
, coord_t lib2
)
773 board_trait_queue(board
, lib1
);
774 board_trait_queue(board
, lib2
);
778 board_atariable_rm(struct board
*board
, group_t group
, coord_t lib1
, coord_t lib2
)
781 board_trait_queue(board
, lib1
);
782 board_trait_queue(board
, lib2
);
787 board_group_addlib(struct board
*board
, group_t group
, coord_t coord
)
790 fprintf(stderr
, "Group %d[%s] %d: Adding liberty %s\n",
791 group_base(group
), coord2sstr(group_base(group
), board
),
792 board_group_info(board
, group
).libs
, coord2sstr(coord
, board
));
795 check_libs_consistency(board
, group
);
797 struct group
*gi
= &board_group_info(board
, group
);
798 bool onestone
= group_is_onestone(board
, group
);
799 if (gi
->libs
< GROUP_KEEP_LIBS
) {
800 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++) {
802 /* Seems extra branch just slows it down */
806 if (unlikely(gi
->lib
[i
] == coord
))
810 board_capturable_add(board
, group
, coord
, onestone
);
811 } else if (gi
->libs
== 1) {
812 board_capturable_rm(board
, group
, gi
->lib
[0], onestone
);
813 board_atariable_add(board
, group
, gi
->lib
[0], coord
);
814 } else if (gi
->libs
== 2) {
815 board_atariable_rm(board
, group
, gi
->lib
[0], gi
->lib
[1]);
817 gi
->lib
[gi
->libs
++] = coord
;
820 check_libs_consistency(board
, group
);
824 board_group_find_extra_libs(struct board
*board
, group_t group
, struct group
*gi
, coord_t avoid
)
826 /* Add extra liberty from the board to our liberty list. */
827 unsigned char watermark
[board_size2(board
) / 8];
828 memset(watermark
, 0, sizeof(watermark
));
829 #define watermark_get(c) (watermark[c >> 3] & (1 << (c & 7)))
830 #define watermark_set(c) watermark[c >> 3] |= (1 << (c & 7))
832 for (int i
= 0; i
< GROUP_KEEP_LIBS
- 1; i
++)
833 watermark_set(gi
->lib
[i
]);
834 watermark_set(avoid
);
836 foreach_in_group(board
, group
) {
838 foreach_neighbor(board
, coord2
, {
839 if (board_at(board
, c
) + watermark_get(c
) != S_NONE
)
842 gi
->lib
[gi
->libs
++] = c
;
843 if (unlikely(gi
->libs
>= GROUP_KEEP_LIBS
))
846 } foreach_in_group_end
;
852 board_group_rmlib(struct board
*board
, group_t group
, coord_t coord
)
855 fprintf(stderr
, "Group %d[%s] %d: Removing liberty %s\n",
856 group_base(group
), coord2sstr(group_base(group
), board
),
857 board_group_info(board
, group
).libs
, coord2sstr(coord
, board
));
860 struct group
*gi
= &board_group_info(board
, group
);
861 bool onestone
= group_is_onestone(board
, group
);
862 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++) {
864 /* Seems extra branch just slows it down */
868 if (likely(gi
->lib
[i
] != coord
))
871 coord_t lib
= gi
->lib
[i
] = gi
->lib
[--gi
->libs
];
872 gi
->lib
[gi
->libs
] = 0;
874 check_libs_consistency(board
, group
);
876 /* Postpone refilling lib[] until we need to. */
877 assert(GROUP_REFILL_LIBS
> 1);
878 if (gi
->libs
> GROUP_REFILL_LIBS
)
880 if (gi
->libs
== GROUP_REFILL_LIBS
)
881 board_group_find_extra_libs(board
, group
, gi
, coord
);
884 board_atariable_add(board
, group
, gi
->lib
[0], gi
->lib
[1]);
885 } else if (gi
->libs
== 1) {
886 board_capturable_add(board
, group
, gi
->lib
[0], onestone
);
887 board_atariable_rm(board
, group
, gi
->lib
[0], lib
);
888 } else if (gi
->libs
== 0)
889 board_capturable_rm(board
, group
, lib
, onestone
);
893 /* This is ok even if gi->libs < GROUP_KEEP_LIBS since we
894 * can call this multiple times per coord. */
895 check_libs_consistency(board
, group
);
900 /* This is a low-level routine that doesn't maintain consistency
901 * of all the board data structures. */
903 board_remove_stone(struct board
*board
, group_t group
, coord_t c
)
905 enum stone color
= board_at(board
, c
);
906 board_at(board
, c
) = S_NONE
;
907 group_at(board
, c
) = 0;
908 board_hash_update(board
, c
, color
);
910 /* We mark as cannot-capture now. If this is a ko/snapback,
911 * we will get incremented later in board_group_addlib(). */
912 trait_at(board
, c
, S_BLACK
).cap
= trait_at(board
, c
, S_BLACK
).cap1
= 0;
913 trait_at(board
, c
, S_WHITE
).cap
= trait_at(board
, c
, S_WHITE
).cap1
= 0;
914 board_trait_queue(board
, c
);
917 /* Increase liberties of surrounding groups */
919 foreach_neighbor(board
, coord
, {
920 dec_neighbor_count_at(board
, c
, color
);
921 board_trait_queue(board
, c
);
922 group_t g
= group_at(board
, c
);
924 board_group_addlib(board
, g
, coord
);
928 fprintf(stderr
, "pushing free move [%d]: %d,%d\n", board
->flen
, coord_x(c
, board
), coord_y(c
, board
));
929 board
->f
[board
->flen
++] = c
;
932 static int profiling_noinline
933 board_group_capture(struct board
*board
, group_t group
)
937 foreach_in_group(board
, group
) {
938 board
->captures
[stone_other(board_at(board
, c
))]++;
939 board_remove_stone(board
, group
, c
);
941 } foreach_in_group_end
;
943 struct group
*gi
= &board_group_info(board
, group
);
944 assert(gi
->libs
== 0);
945 memset(gi
, 0, sizeof(*gi
));
951 static void profiling_noinline
952 add_to_group(struct board
*board
, group_t group
, coord_t prevstone
, coord_t coord
)
955 struct group
*gi
= &board_group_info(board
, group
);
956 bool onestone
= group_is_onestone(board
, group
);
959 /* Our group is temporarily in atari; make sure the capturable
960 * counts also correspond to the newly added stone before we
961 * start adding liberties again so bump-dump ops match. */
962 enum stone capturing_color
= stone_other(board_at(board
, group
));
963 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
965 coord_t lib
= board_group_info(board
, group
).lib
[0];
966 if (coord_is_adjecent(lib
, coord
, board
)) {
968 fprintf(stderr
, "add_to_group %s: %s[%d] bump\n", coord2sstr(group
, board
), coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
);
969 trait_at(board
, lib
, capturing_color
).cap
++;
970 /* This is never a 1-stone group, obviously. */
971 board_trait_queue(board
, lib
);
975 /* We are not 1-stone group anymore, update the cap1
976 * counter specifically. */
977 foreach_neighbor(board
, group
, {
978 if (board_at(board
, c
) != S_NONE
) continue;
979 trait_at(board
, c
, capturing_color
).cap1
--;
980 board_trait_queue(board
, c
);
986 group_at(board
, coord
) = group
;
987 groupnext_at(board
, coord
) = groupnext_at(board
, prevstone
);
988 groupnext_at(board
, prevstone
) = coord
;
990 foreach_neighbor(board
, coord
, {
991 if (board_at(board
, c
) == S_NONE
)
992 board_group_addlib(board
, group
, c
);
996 fprintf(stderr
, "add_to_group: added (%d,%d ->) %d,%d (-> %d,%d) to group %d\n",
997 coord_x(prevstone
, board
), coord_y(prevstone
, board
),
998 coord_x(coord
, board
), coord_y(coord
, board
),
999 groupnext_at(board
, coord
) % board_size(board
), groupnext_at(board
, coord
) / board_size(board
),
1003 static void profiling_noinline
1004 merge_groups(struct board
*board
, group_t group_to
, group_t group_from
)
1007 fprintf(stderr
, "board_play_raw: merging groups %d -> %d\n",
1008 group_base(group_from
), group_base(group_to
));
1009 struct group
*gi_from
= &board_group_info(board
, group_from
);
1010 struct group
*gi_to
= &board_group_info(board
, group_to
);
1011 bool onestone_from
= group_is_onestone(board
, group_from
);
1012 bool onestone_to
= group_is_onestone(board
, group_to
);
1014 /* We do this early before the group info is rewritten. */
1015 if (gi_from
->libs
== 2)
1016 board_atariable_rm(board
, group_from
, gi_from
->lib
[0], gi_from
->lib
[1]);
1017 else if (gi_from
->libs
== 1)
1018 board_capturable_rm(board
, group_from
, gi_from
->lib
[0], onestone_from
);
1021 fprintf(stderr
,"---- (froml %d, tol %d)\n", gi_from
->libs
, gi_to
->libs
);
1023 if (gi_to
->libs
< GROUP_KEEP_LIBS
) {
1024 for (int i
= 0; i
< gi_from
->libs
; i
++) {
1025 for (int j
= 0; j
< gi_to
->libs
; j
++)
1026 if (gi_to
->lib
[j
] == gi_from
->lib
[i
])
1028 if (gi_to
->libs
== 0) {
1029 board_capturable_add(board
, group_to
, gi_from
->lib
[i
], onestone_to
);
1030 } else if (gi_to
->libs
== 1) {
1031 board_capturable_rm(board
, group_to
, gi_to
->lib
[0], onestone_to
);
1032 board_atariable_add(board
, group_to
, gi_to
->lib
[0], gi_from
->lib
[i
]);
1033 } else if (gi_to
->libs
== 2) {
1034 board_atariable_rm(board
, group_to
, gi_to
->lib
[0], gi_to
->lib
[1]);
1036 gi_to
->lib
[gi_to
->libs
++] = gi_from
->lib
[i
];
1037 if (gi_to
->libs
>= GROUP_KEEP_LIBS
)
1044 if (gi_to
->libs
== 1) {
1045 enum stone capturing_color
= stone_other(board_at(board
, group_to
));
1046 assert(capturing_color
== S_BLACK
|| capturing_color
== S_WHITE
);
1048 /* Our group is currently in atari; make sure we properly
1049 * count in even the neighbors from the other group in the
1050 * capturable counter. */
1051 coord_t lib
= board_group_info(board
, group_to
).lib
[0];
1052 foreach_neighbor(board
, lib
, {
1053 if (DEBUGL(8) && group_at(board
, c
) == group_from
)
1054 fprintf(stderr
, "%s[%d] cap bump\n", coord2sstr(lib
, board
), trait_at(board
, lib
, capturing_color
).cap
);
1055 trait_at(board
, lib
, capturing_color
).cap
+= (group_at(board
, c
) == group_from
);
1056 /* This is never a 1-stone group, obviously. */
1058 board_trait_queue(board
, lib
);
1061 /* We are not 1-stone group anymore, update the cap1
1062 * counter specifically. */
1063 foreach_neighbor(board
, group_to
, {
1064 if (board_at(board
, c
) != S_NONE
) continue;
1065 trait_at(board
, c
, capturing_color
).cap1
--;
1066 board_trait_queue(board
, c
);
1072 coord_t last_in_group
;
1073 foreach_in_group(board
, group_from
) {
1075 group_at(board
, c
) = group_to
;
1076 } foreach_in_group_end
;
1077 groupnext_at(board
, last_in_group
) = groupnext_at(board
, group_base(group_to
));
1078 groupnext_at(board
, group_base(group_to
)) = group_base(group_from
);
1079 memset(gi_from
, 0, sizeof(struct group
));
1082 fprintf(stderr
, "board_play_raw: merged group: %d\n",
1083 group_base(group_to
));
1086 static group_t profiling_noinline
1087 new_group(struct board
*board
, coord_t coord
)
1089 group_t group
= coord
;
1090 struct group
*gi
= &board_group_info(board
, group
);
1091 foreach_neighbor(board
, coord
, {
1092 if (board_at(board
, c
) == S_NONE
)
1093 /* board_group_addlib is ridiculously expensive for us */
1094 #if GROUP_KEEP_LIBS < 4
1095 if (gi
->libs
< GROUP_KEEP_LIBS
)
1097 gi
->lib
[gi
->libs
++] = c
;
1100 group_at(board
, coord
) = group
;
1101 groupnext_at(board
, coord
) = 0;
1104 board_atariable_add(board
, group
, gi
->lib
[0], gi
->lib
[1]);
1105 else if (gi
->libs
== 1)
1106 board_capturable_add(board
, group
, gi
->lib
[0], true);
1107 check_libs_consistency(board
, group
);
1110 fprintf(stderr
, "new_group: added %d,%d to group %d\n",
1111 coord_x(coord
, board
), coord_y(coord
, board
),
1117 static inline group_t
1118 play_one_neighbor(struct board
*board
,
1119 coord_t coord
, enum stone color
, enum stone other_color
,
1120 coord_t c
, group_t group
)
1122 enum stone ncolor
= board_at(board
, c
);
1123 group_t ngroup
= group_at(board
, c
);
1125 inc_neighbor_count_at(board
, c
, color
);
1126 /* We can be S_NONE, in that case we need to update the safety
1127 * trait since we might be left with only one liberty. */
1128 board_trait_queue(board
, c
);
1133 board_group_rmlib(board
, ngroup
, coord
);
1135 fprintf(stderr
, "board_play_raw: reducing libs for group %d (%d:%d,%d)\n",
1136 group_base(ngroup
), ncolor
, color
, other_color
);
1138 if (ncolor
== color
&& ngroup
!= group
) {
1141 add_to_group(board
, group
, c
, coord
);
1143 merge_groups(board
, group
, ngroup
);
1145 } else if (ncolor
== other_color
) {
1147 struct group
*gi
= &board_group_info(board
, ngroup
);
1148 fprintf(stderr
, "testing captured group %d[%s]: ", group_base(ngroup
), coord2sstr(group_base(ngroup
), board
));
1149 for (int i
= 0; i
< GROUP_KEEP_LIBS
; i
++)
1150 fprintf(stderr
, "%s ", coord2sstr(gi
->lib
[i
], board
));
1151 fprintf(stderr
, "\n");
1153 if (unlikely(board_group_captured(board
, ngroup
)))
1154 board_group_capture(board
, ngroup
);
1159 /* We played on a place with at least one liberty. We will become a member of
1160 * some group for sure. */
1161 static group_t profiling_noinline
1162 board_play_outside(struct board
*board
, struct move
*m
, int f
)
1164 coord_t coord
= m
->coord
;
1165 enum stone color
= m
->color
;
1166 enum stone other_color
= stone_other(color
);
1169 board
->f
[f
] = board
->f
[--board
->flen
];
1171 fprintf(stderr
, "popping free move [%d->%d]: %d\n", board
->flen
, f
, board
->f
[f
]);
1173 #if defined(BOARD_TRAITS) && defined(DEBUG)
1174 /* Sanity check that cap matches reality. */
1177 foreach_neighbor(board
, coord
, {
1178 group_t g
= group_at(board
, c
);
1179 a
+= g
&& (board_at(board
, c
) == other_color
&& board_group_info(board
, g
).libs
== 1);
1180 b
+= g
&& (board_at(board
, c
) == other_color
&& board_group_info(board
, g
).libs
== 1) && group_is_onestone(board
, g
);
1182 assert(a
== trait_at(board
, coord
, color
).cap
);
1183 assert(b
== trait_at(board
, coord
, color
).cap1
);
1184 assert(board_trait_safe(board
, coord
, color
) == trait_at(board
, coord
, color
).safe
);
1187 foreach_neighbor(board
, coord
, {
1188 group
= play_one_neighbor(board
, coord
, color
, other_color
, c
, group
);
1191 board_at(board
, coord
) = color
;
1192 if (unlikely(!group
))
1193 group
= new_group(board
, coord
);
1194 board_gamma_update(board
, coord
, S_BLACK
);
1195 board_gamma_update(board
, coord
, S_WHITE
);
1197 board
->last_move2
= board
->last_move
;
1198 board
->last_move
= *m
;
1200 board_hash_update(board
, coord
, color
);
1201 board_symmetry_update(board
, &board
->symmetry
, coord
);
1202 struct move ko
= { pass
, S_NONE
};
1208 /* We played in an eye-like shape. Either we capture at least one of the eye
1209 * sides in the process of playing, or return -1. */
1210 static int profiling_noinline
1211 board_play_in_eye(struct board
*board
, struct move
*m
, int f
)
1213 coord_t coord
= m
->coord
;
1214 enum stone color
= m
->color
;
1215 /* Check ko: Capture at a position of ko capture one move ago */
1216 if (unlikely(color
== board
->ko
.color
&& coord
== board
->ko
.coord
)) {
1218 fprintf(stderr
, "board_check: ko at %d,%d color %d\n", coord_x(coord
, board
), coord_y(coord
, board
), color
);
1220 } else if (DEBUGL(6)) {
1221 fprintf(stderr
, "board_check: no ko at %d,%d,%d - ko is %d,%d,%d\n",
1222 color
, coord_x(coord
, board
), coord_y(coord
, board
),
1223 board
->ko
.color
, coord_x(board
->ko
.coord
, board
), coord_y(board
->ko
.coord
, board
));
1226 struct move ko
= { pass
, S_NONE
};
1228 int captured_groups
= 0;
1230 foreach_neighbor(board
, coord
, {
1231 group_t g
= group_at(board
, c
);
1233 fprintf(stderr
, "board_check: group %d has %d libs\n",
1234 g
, board_group_info(board
, g
).libs
);
1235 captured_groups
+= (board_group_info(board
, g
).libs
== 1);
1238 if (likely(captured_groups
== 0)) {
1241 board_print(board
, stderr
);
1242 fprintf(stderr
, "board_check: one-stone suicide\n");
1248 /* We _will_ for sure capture something. */
1249 assert(trait_at(board
, coord
, color
).cap
> 0);
1250 assert(trait_at(board
, coord
, color
).safe
== board_trait_safe(board
, coord
, color
));
1253 board
->f
[f
] = board
->f
[--board
->flen
];
1255 fprintf(stderr
, "popping free move [%d->%d]: %d\n", board
->flen
, f
, board
->f
[f
]);
1257 foreach_neighbor(board
, coord
, {
1258 inc_neighbor_count_at(board
, c
, color
);
1259 /* Originally, this could not have changed any trait
1260 * since no neighbors were S_NONE, however by now some
1261 * of them might be removed from the board. */
1262 board_trait_queue(board
, c
);
1264 group_t group
= group_at(board
, c
);
1268 board_group_rmlib(board
, group
, coord
);
1270 fprintf(stderr
, "board_play_raw: reducing libs for group %d\n",
1273 if (board_group_captured(board
, group
)) {
1274 if (board_group_capture(board
, group
) == 1) {
1275 /* If we captured multiple groups at once,
1276 * we can't be fighting ko so we don't need
1277 * to check for that. */
1278 ko
.color
= stone_other(color
);
1280 board
->last_ko
= ko
;
1281 board
->last_ko_age
= board
->moves
;
1283 fprintf(stderr
, "guarding ko at %d,%s\n", ko
.color
, coord2sstr(ko
.coord
, board
));
1288 board_at(board
, coord
) = color
;
1289 group_t group
= new_group(board
, coord
);
1290 board_gamma_update(board
, coord
, S_BLACK
);
1291 board_gamma_update(board
, coord
, S_WHITE
);
1293 board
->last_move2
= board
->last_move
;
1294 board
->last_move
= *m
;
1296 board_hash_update(board
, coord
, color
);
1297 board_hash_commit(board
);
1298 board_traits_recompute(board
);
1299 board_symmetry_update(board
, &board
->symmetry
, coord
);
1305 static int __attribute__((flatten
))
1306 board_play_f(struct board
*board
, struct move
*m
, int f
)
1309 fprintf(stderr
, "board_play(%s): ---- Playing %d,%d\n", coord2sstr(m
->coord
, board
), coord_x(m
->coord
, board
), coord_y(m
->coord
, board
));
1311 if (likely(!board_is_eyelike(board
, m
->coord
, stone_other(m
->color
)))) {
1312 /* NOT playing in an eye. Thus this move has to succeed. (This
1313 * is thanks to New Zealand rules. Otherwise, multi-stone
1314 * suicide might fail.) */
1315 group_t group
= board_play_outside(board
, m
, f
);
1316 if (unlikely(board_group_captured(board
, group
))) {
1317 board_group_capture(board
, group
);
1319 board_hash_commit(board
);
1320 board_traits_recompute(board
);
1323 return board_play_in_eye(board
, m
, f
);
1328 board_play(struct board
*board
, struct move
*m
)
1330 if (unlikely(is_pass(m
->coord
) || is_resign(m
->coord
))) {
1331 struct move nomove
= { pass
, S_NONE
};
1333 board
->last_move2
= board
->last_move
;
1334 board
->last_move
= *m
;
1339 for (f
= 0; f
< board
->flen
; f
++)
1340 if (board
->f
[f
] == m
->coord
)
1341 return board_play_f(board
, m
, f
);
1344 fprintf(stderr
, "board_check: stone exists\n");
1350 board_try_random_move(struct board
*b
, enum stone color
, coord_t
*coord
, int f
, ppr_permit permit
, void *permit_data
)
1353 struct move m
= { *coord
, color
};
1355 fprintf(stderr
, "trying random move %d: %d,%d\n", f
, coord_x(*coord
, b
), coord_y(*coord
, b
));
1356 if (unlikely(board_is_one_point_eye(b
, *coord
, color
)) /* bad idea to play into one, usually */
1357 || !board_is_valid_move(b
, &m
)
1358 || (permit
&& !permit(permit_data
, b
, &m
)))
1360 *coord
= m
.coord
; // permit might modify it
1361 return likely(board_play_f(b
, &m
, f
) >= 0);
1365 board_play_random(struct board
*b
, enum stone color
, coord_t
*coord
, ppr_permit permit
, void *permit_data
)
1367 if (unlikely(b
->flen
== 0))
1370 int base
= fast_random(b
->flen
), f
;
1371 for (f
= base
; f
< b
->flen
; f
++)
1372 if (board_try_random_move(b
, color
, coord
, f
, permit
, permit_data
))
1374 for (f
= 0; f
< base
; f
++)
1375 if (board_try_random_move(b
, color
, coord
, f
, permit
, permit_data
))
1380 struct move m
= { pass
, color
};
1386 board_is_false_eyelike(struct board
*board
, coord_t coord
, enum stone eye_color
)
1388 enum stone color_diag_libs
[S_MAX
] = {0, 0, 0, 0};
1390 /* XXX: We attempt false eye detection but we will yield false
1391 * positives in case of http://senseis.xmp.net/?TwoHeadedDragon :-( */
1393 foreach_diag_neighbor(board
, coord
) {
1394 color_diag_libs
[(enum stone
) board_at(board
, c
)]++;
1395 } foreach_diag_neighbor_end
;
1396 /* For false eye, we need two enemy stones diagonally in the
1397 * middle of the board, or just one enemy stone at the edge
1398 * or in the corner. */
1399 color_diag_libs
[stone_other(eye_color
)] += !!color_diag_libs
[S_OFFBOARD
];
1400 return color_diag_libs
[stone_other(eye_color
)] >= 2;
1404 board_is_one_point_eye(struct board
*board
, coord_t coord
, enum stone eye_color
)
1406 return board_is_eyelike(board
, coord
, eye_color
)
1407 && !board_is_false_eyelike(board
, coord
, eye_color
);
1411 board_get_one_point_eye(struct board
*board
, coord_t coord
)
1413 if (board_is_one_point_eye(board
, coord
, S_WHITE
))
1415 else if (board_is_one_point_eye(board
, coord
, S_BLACK
))
1423 board_fast_score(struct board
*board
)
1426 memset(scores
, 0, sizeof(scores
));
1428 foreach_point(board
) {
1429 enum stone color
= board_at(board
, c
);
1430 if (color
== S_NONE
)
1431 color
= board_get_one_point_eye(board
, c
);
1433 // fprintf(stderr, "%d, %d ++%d = %d\n", coord_x(c, board), coord_y(c, board), color, scores[color]);
1434 } foreach_point_end
;
1436 return board
->komi
+ board
->handicap
+ scores
[S_WHITE
] - scores
[S_BLACK
];
1439 /* Owner map: 0: undecided; 1: black; 2: white; 3: dame */
1441 /* One flood-fill iteration; returns true if next iteration
1444 board_tromp_taylor_iter(struct board
*board
, int *ownermap
)
1446 bool needs_update
= false;
1447 foreach_free_point(board
) {
1448 /* Ignore occupied and already-dame positions. */
1449 assert(board_at(board
, c
) == S_NONE
);
1450 if (ownermap
[c
] == 3)
1452 /* Count neighbors. */
1454 foreach_neighbor(board
, c
, {
1457 /* If we have neighbors of both colors, or dame,
1458 * we are dame too. */
1459 if ((nei
[1] && nei
[2]) || nei
[3]) {
1461 /* Speed up the propagation. */
1462 foreach_neighbor(board
, c
, {
1463 if (board_at(board
, c
) == S_NONE
)
1466 needs_update
= true;
1469 /* If we have neighbors of one color, we are owned
1470 * by that color, too. */
1471 if (!ownermap
[c
] && (nei
[1] || nei
[2])) {
1472 int newowner
= nei
[1] ? 1 : 2;
1473 ownermap
[c
] = newowner
;
1474 /* Speed up the propagation. */
1475 foreach_neighbor(board
, c
, {
1476 if (board_at(board
, c
) == S_NONE
&& !ownermap
[c
])
1477 ownermap
[c
] = newowner
;
1479 needs_update
= true;
1482 } foreach_free_point_end
;
1483 return needs_update
;
1486 /* Tromp-Taylor Counting */
1488 board_official_score(struct board
*board
, struct move_queue
*q
)
1491 /* A point P, not colored C, is said to reach C, if there is a path of
1492 * (vertically or horizontally) adjacent points of P's color from P to
1493 * a point of color C.
1495 * A player's score is the number of points of her color, plus the
1496 * number of empty points that reach only her color. */
1498 int ownermap
[board_size2(board
)];
1500 const int o
[4] = {0, 1, 2, 0};
1501 foreach_point(board
) {
1502 ownermap
[c
] = o
[board_at(board
, c
)];
1503 s
[board_at(board
, c
)]++;
1504 } foreach_point_end
;
1507 /* Process dead groups. */
1508 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
1509 foreach_in_group(board
, q
->move
[i
]) {
1510 enum stone color
= board_at(board
, c
);
1511 ownermap
[c
] = o
[stone_other(color
)];
1512 s
[color
]--; s
[stone_other(color
)]++;
1513 } foreach_in_group_end
;
1517 /* We need to special-case empty board. */
1518 if (!s
[S_BLACK
] && !s
[S_WHITE
])
1519 return board
->komi
+ board
->handicap
;
1521 while (board_tromp_taylor_iter(board
, ownermap
))
1522 /* Flood-fill... */;
1525 memset(scores
, 0, sizeof(scores
));
1527 foreach_point(board
) {
1528 assert(board_at(board
, c
) == S_OFFBOARD
|| ownermap
[c
] != 0);
1529 if (ownermap
[c
] == 3)
1531 scores
[ownermap
[c
]]++;
1532 } foreach_point_end
;
1534 return board
->komi
+ board
->handicap
+ scores
[S_WHITE
] - scores
[S_BLACK
];