1 /* probdist.h must be included before the include goard since we require
2 * proper including order. */
19 /* Maximum supported board size. (Without the S_OFFBOARD edges.) */
20 #define BOARD_MAX_SIZE 19
23 /* The board implementation has bunch of optional features.
24 * Turn them on below: */
26 #define WANT_BOARD_C // capturable groups queue
28 //#define BOARD_SIZE 9 // constant board size, allows better optimization
30 //#define BOARD_SPATHASH // incremental patternsp.h hashes
31 #define BOARD_SPATHASH_MAXD 3 // maximal diameter
33 #define BOARD_PAT3 // incremental 3x3 pattern codes
35 //#define BOARD_TRAITS 1 // incremental point traits (see struct btraits)
36 //#define BOARD_TRAIT_SAFE 1 // include btraits.safe (rather expensive, unused)
37 //#define BOARD_TRAIT_SAFE 2 // include btraits.safe based on full is_bad_selfatari()
39 //#define BOARD_UNDO_CHECKS 1 // Guard against invalid quick_play() / quick_undo() uses
41 #define BOARD_MAX_COORDS ((BOARD_MAX_SIZE+2) * (BOARD_MAX_SIZE+2) )
42 #define BOARD_MAX_MOVES (BOARD_MAX_SIZE * BOARD_MAX_SIZE)
43 #define BOARD_MAX_GROUPS (BOARD_MAX_SIZE * BOARD_MAX_SIZE / 2)
55 /* Some engines might normalize their reading and skip symmetrical
56 * moves. We will tell them how can they do it. */
57 struct board_symmetry
{
58 /* Playground is in this rectangle. */
60 /* d == 0: Full rectangle
61 * d == 1: Top triangle */
63 /* General symmetry type. */
64 /* Note that the above is redundant to this, but just provided
65 * for easier usage. */
70 typedef uint64_t hash_t
;
71 #define PRIhash PRIx64
73 /* XXX: This really belongs in pattern3.h, unfortunately that would mean
74 * a dependency hell. */
75 typedef uint32_t hash3_t
; // 3x3 pattern hash
78 /* Note that "group" is only chain of stones that is solidly
79 * connected for us. */
80 typedef coord_t group_t
;
83 /* We keep track of only up to GROUP_KEEP_LIBS; over that, we
85 /* _Combination_ of these two values can make some difference
86 * in performance - fine-tune. */
87 #define GROUP_KEEP_LIBS 10
88 // refill lib[] only when we hit this; this must be at least 2!
89 // Moggy requires at least 3 - see below for semantic impact.
90 #define GROUP_REFILL_LIBS 5
91 coord_t lib
[GROUP_KEEP_LIBS
];
92 /* libs is only LOWER BOUND for the number of real liberties!!!
93 * It denotes only number of items in lib[], thus you can rely
94 * on it to store real liberties only up to <= GROUP_REFILL_LIBS. */
98 struct neighbor_colors
{
103 /* Point traits bitmap; we update this information incrementally,
104 * it can be used e.g. for fast pattern features matching. */
106 /* Number of neighbors we can capture. 0=this move is
107 * not capturing, 1..4=this many neighbors we can capture
108 * (can be multiple neighbors of same group). */
110 /* Number of 1-stone neighbors we can capture. */
112 #ifdef BOARD_TRAIT_SAFE
113 /* Whether it is SAFE to play here. This is essentially just
114 * cached result of board_safe_to_play(). (Of course the concept
115 * of "safety" is not perfect here, but it's the cheapest
116 * reasonable thing we can do.) */
119 /* Whether we need to re-compute this coordinate; used to
120 * weed out duplicates. Maintained only for S_BLACK. */
125 /* Quick hack to help ensure tactics code stays within quick board limitations.
126 * Ideally we'd have two different types for boards and quick_boards. The idea
127 * of having casts / duplicate api all over the place isn't so appealing though... */
128 #ifndef QUICK_BOARD_CODE
129 #define FB_ONLY(field) field
131 #define FB_ONLY(field) field ## _disabled
132 // Try to make error messages more helpful ...
133 #define clen clen_field_not_supported_for_quick_boards
134 #define flen flen_field_not_supported_for_quick_boards
137 /* You should treat this struct as read-only. Always call functions below if
138 * you want to change it. */
141 int size
; /* Including S_OFFBOARD margin - see below. */
142 int size2
; /* size^2 */
143 int bits2
; /* ceiling(log2(size2)) */
147 /* The ruleset is currently almost never taken into account;
148 * the board implementation is basically Chinese rules (handicap
149 * stones compensation) w/ suicide (or you can look at it as
150 * New Zealand w/o handi stones compensation), while the engine
151 * enforces no-suicide, making for real Chinese rules.
152 * However, we accept suicide moves by the opponent, so we
153 * should work with rules allowing suicide, just not taking
154 * full advantage of them. */
156 RULES_CHINESE
, /* default value */
160 RULES_STONES_ONLY
, /* do not count eyes */
161 /* http://home.snafu.de/jasiek/siming.html */
162 /* Simplified ING rules - RULES_CHINESE with handicaps
163 * counting as points and pass stones. Also should
164 * allow suicide, but Pachi will never suicide
166 /* XXX: I couldn't find the point about pass stones
167 * in the rule text, but it is Robert Jasiek's
168 * interpretation of them... These rules were
169 * used e.g. at the EGC2012 13x13 tournament.
170 * They are not supported by KGS. */
177 /* Iterator offsets for foreach_neighbor*() */
178 int nei8
[8], dnei
[4];
181 struct move last_move
;
182 struct move last_move2
; /* second-to-last move */
183 FB_ONLY(struct move last_move3
); /* just before last_move2, only set if last_move is pass */
184 FB_ONLY(struct move last_move4
); /* just before last_move3, only set if last_move & last_move2 are pass */
185 /* Whether we tried to add a hash twice; board_play*() can
186 * set this, but it will still carry out the move as well! */
187 FB_ONLY(bool superko_violation
);
189 /* The following two structures are goban maps and are indexed by
190 * coord.pos. The map is surrounded by a one-point margin from
191 * S_OFFBOARD stones in order to speed up some internal loops.
192 * Some of the foreach iterators below might include these points;
193 * you need to handle them yourselves, if you need to. */
195 /* Stones played on the board */
196 enum stone
*b
; /* enum stone */
197 /* Group id the stones are part of; 0 == no group */
199 /* Positions of next stones in the stone group; 0 == last stone */
201 /* Neighboring colors; numbers of neighbors of index color */
202 struct neighbor_colors
*n
;
203 /* Zobrist hash for each position */
205 #ifdef BOARD_SPATHASH
206 /* For spatial hashes, we use only 24 bits. */
207 /* [0] is d==1, we don't keep hash for d==0. */
208 /* We keep hashes for black-to-play ([][0]) and white-to-play
209 * ([][1], reversed stone colors since we match all patterns as
211 FB_ONLY(uint32_t (*spathash
))[BOARD_SPATHASH_MAXD
][2];
214 /* 3x3 pattern code for each position; see pattern3.h for encoding
215 * specification. The information is only valid for empty points. */
216 FB_ONLY(hash3_t
*pat3
);
219 /* Incrementally matched point traits information, black-to-play
220 * ([][0]) and white-to-play ([][1]). */
221 /* The information is only valid for empty points. */
222 FB_ONLY(struct btraits (*t
)[2]);
224 /* Cached information on x-y coordinates so that we avoid division. */
227 /* Group information - indexed by gid (which is coord of base group stone) */
230 /* Positions of free positions - queue (not map) */
231 /* Note that free position here is any valid move; including single-point eyes!
232 * However, pass is not included. */
233 FB_ONLY(coord_t
*f
); FB_ONLY(int flen
);
236 /* Queue of capturable groups */
237 FB_ONLY(group_t
*c
); FB_ONLY(int clen
);
241 /* Queue of positions that need their traits updated */
242 FB_ONLY(coord_t
*tq
); FB_ONLY(int tqlen
);
245 /* Symmetry information */
246 FB_ONLY(struct board_symmetry symmetry
);
248 /* Last ko played on the board. */
249 FB_ONLY(struct move last_ko
);
250 FB_ONLY(int last_ko_age
);
255 #ifdef BOARD_UNDO_CHECKS
256 /* Guard against invalid quick_play() / quick_undo() uses */
260 /* Engine-specific state; persistent through board development,
261 * is reset only at clear_board. */
264 /* Playout-specific state; persistent through board development,
265 * but its lifetime is maintained in play_random_game(); it should
266 * not be set outside of it. */
270 /* --- PRIVATE DATA --- */
272 /* For superko check: */
274 /* Board "history" - hashes encountered. Size of the hash should be
275 * >> board_size^2. */
276 #define history_hash_bits 12
277 #define history_hash_mask ((1 << history_hash_bits) - 1)
278 #define history_hash_prev(i) ((i - 1) & history_hash_mask)
279 #define history_hash_next(i) ((i + 1) & history_hash_mask)
280 FB_ONLY(hash_t history_hash
)[1 << history_hash_bits
];
281 /* Hash of current board position. */
282 FB_ONLY(hash_t hash
);
283 /* Hash of current board position quadrants. */
284 FB_ONLY(hash_t qhash
)[4];
296 coord_t stones
[BOARD_MAX_MOVES
]; // TODO try small array
300 struct move last_move2
;
308 struct undo_merge merged
[4];
312 struct undo_enemy enemies
[4];
314 int captures
; /* number of stones captured */
319 /* Avoid unused variable warnings */
320 #define board_size(b_) (((b_) == (b_)) ? BOARD_SIZE + 2 : 0)
321 #define board_size2(b_) (board_size(b_) * board_size(b_))
322 #define real_board_size(b_) (((b_) == (b_)) ? BOARD_SIZE : 0)
324 #define board_size(b_) ((b_)->size)
325 #define board_size2(b_) ((b_)->size2)
326 #define real_board_size(b_) ((b_)->size - 2)
329 /* This is a shortcut for taking different action on smaller
330 * and large boards (e.g. picking different variable defaults).
331 * This is of course less optimal than fine-tuning dependency
332 * function of values on board size, but that is difficult and
333 * possibly not very rewarding if you are interested just in
335 #define board_large(b_) (board_size(b_)-2 >= 15)
336 #define board_small(b_) (board_size(b_)-2 <= 9)
339 # define board_bits2(b_) 9
340 #elif BOARD_SIZE == 13
341 # define board_bits2(b_) 8
342 #elif BOARD_SIZE == 9
343 # define board_bits2(b_) 7
345 # define board_bits2(b_) ((b_)->bits2)
348 #define board_at(b_, c) ((b_)->b[c])
349 #define board_atxy(b_, x, y) ((b_)->b[(x) + board_size(b_) * (y)])
351 #define group_at(b_, c) ((b_)->g[c])
352 #define group_atxy(b_, x, y) ((b_)->g[(x) + board_size(b_) * (y)])
354 /* Warning! Neighbor count is not kept up-to-date for S_NONE! */
355 #define neighbor_count_at(b_, coord, color) ((b_)->n[coord].colors[(enum stone) color])
356 #define set_neighbor_count_at(b_, coord, color, count) (neighbor_count_at(b_, coord, color) = (count))
357 #define inc_neighbor_count_at(b_, coord, color) (neighbor_count_at(b_, coord, color)++)
358 #define dec_neighbor_count_at(b_, coord, color) (neighbor_count_at(b_, coord, color)--)
359 #define immediate_liberty_count(b_, coord) (4 - neighbor_count_at(b_, coord, S_BLACK) - neighbor_count_at(b_, coord, S_WHITE) - neighbor_count_at(b_, coord, S_OFFBOARD))
361 #define trait_at(b_, coord, color) (b_)->t[coord][(color) - 1]
363 #define groupnext_at(b_, c) ((b_)->p[c])
364 #define groupnext_atxy(b_, x, y) ((b_)->p[(x) + board_size(b_) * (y)])
366 #define group_base(g_) (g_)
367 #define group_is_onestone(b_, g_) (groupnext_at(b_, group_base(g_)) == 0)
368 #define board_group_info(b_, g_) ((b_)->gi[(g_)])
369 #define board_group_captured(b_, g_) (board_group_info(b_, g_).libs == 0)
370 /* board_group_other_lib() makes sense only for groups with two liberties. */
371 #define board_group_other_lib(b_, g_, l_) (board_group_info(b_, g_).lib[board_group_info(b_, g_).lib[0] != (l_) ? 0 : 1])
373 #define hash_at(b_, coord, color) ((b_)->h[((color) == S_BLACK ? board_size2(b_) : 0) + coord])
375 struct board
*board_init(char *fbookfile
);
376 struct board
*board_copy(struct board
*board2
, struct board
*board1
);
377 void board_done_noalloc(struct board
*board
);
378 void board_done(struct board
*board
);
379 /* size here is without the S_OFFBOARD margin. */
380 void board_resize(struct board
*board
, int size
);
381 void board_clear(struct board
*board
);
383 typedef char *(*board_cprint
)(struct board
*b
, coord_t c
, char *s
, char *end
, void *data
);
384 void board_print(struct board
*board
, FILE *f
);
385 void board_print_custom(struct board
*board
, FILE *f
, board_cprint cprint
, void *data
);
387 /* Debugging: Compare 2 boards byte by byte. Don't use that for sorting =) */
388 int board_cmp(struct board
*b1
, struct board
*b2
);
389 /* Same but only care about fields maintained by quick_play() / quick_undo() */
390 int board_quick_cmp(struct board
*b1
, struct board
*b2
);
392 /* Place given handicap on the board; coordinates are printed to f. */
393 void board_handicap(struct board
*board
, int stones
, FILE *f
);
395 /* Returns group id, 0 on allowed suicide, pass or resign, -1 on error */
396 int board_play(struct board
*board
, struct move
*m
);
397 /* Like above, but plays random move; the move coordinate is recorded
398 * to *coord. This method will never fill your own eye. pass is played
399 * when no move can be played. You can impose extra restrictions if you
400 * supply your own permit function; the permit function can also modify
401 * the move coordinate to redirect the move elsewhere. */
402 typedef bool (*ppr_permit
)(void *data
, struct board
*b
, struct move
*m
);
403 void board_play_random(struct board
*b
, enum stone color
, coord_t
*coord
, ppr_permit permit
, void *permit_data
);
405 /* Undo, supported only for pass moves. Returns -1 on error, 0 otherwise. */
406 int board_undo(struct board
*board
);
408 /* Returns true if given move can be played. */
409 static bool board_is_valid_play(struct board
*b
, enum stone color
, coord_t coord
);
410 static bool board_is_valid_move(struct board
*b
, struct move
*m
);
411 /* Returns true if ko was just taken. */
412 static bool board_playing_ko_threat(struct board
*b
);
413 /* Returns 0 or ID of neighboring group in atari. */
414 static group_t
board_get_atari_neighbor(struct board
*b
, coord_t coord
, enum stone group_color
);
415 /* Returns true if the move is not obvious self-atari. */
416 static bool board_safe_to_play(struct board
*b
, coord_t coord
, enum stone color
);
418 /* Determine number of stones in a group, up to @max stones. */
419 static int group_stone_count(struct board
*b
, group_t group
, int max
);
421 #ifndef QUICK_BOARD_CODE
422 /* Adjust symmetry information as if given coordinate has been played. */
423 void board_symmetry_update(struct board
*b
, struct board_symmetry
*symmetry
, coord_t c
);
424 /* Check if coordinates are within symmetry base. (If false, they can
425 * be derived from the base.) */
426 static bool board_coord_in_symmetry(struct board
*b
, coord_t c
);
429 /* Returns true if given coordinate has all neighbors of given color or the edge. */
430 static bool board_is_eyelike(struct board
*board
, coord_t coord
, enum stone eye_color
);
431 /* Returns true if given coordinate could be a false eye; this check makes
432 * sense only if you already know the coordinate is_eyelike(). */
433 bool board_is_false_eyelike(struct board
*board
, coord_t coord
, enum stone eye_color
);
434 /* Returns true if given coordinate is a 1-pt eye (checks against false eyes, or
435 * at least tries to). */
436 bool board_is_one_point_eye(struct board
*board
, coord_t c
, enum stone eye_color
);
437 /* Returns color of a 1pt eye owner, S_NONE if not an eye. */
438 enum stone
board_get_one_point_eye(struct board
*board
, coord_t c
);
440 /* board_official_score() is the scoring method for yielding score suitable
441 * for external presentation. For fast scoring of entirely filled boards
442 * (e.g. playouts), use board_fast_score(). */
443 /* Positive: W wins */
444 /* Compare number of stones + 1pt eyes. */
445 floating_t
board_fast_score(struct board
*board
);
446 /* Tromp-Taylor scoring, assuming given groups are actually dead. */
448 floating_t
board_official_score(struct board
*board
, struct move_queue
*mq
);
450 /* Set board rules according to given string. Returns false in case
451 * of unknown ruleset name. */
452 bool board_set_rules(struct board
*board
, char *name
);
454 /* Quick play/undo to try out a move.
455 * WARNING Only core board structures are maintained !
456 * Code in between can't rely on anything else.
458 * Currently this means these can't be used:
459 * - incremental patterns (pat3)
460 * - hashes, superko_violation (spathash, hash, qhash, history_hash)
461 * - list of free positions (f / flen)
462 * - list of capturable groups (c / clen)
463 * - traits (btraits, t, tq, tqlen)
464 * - last_move3, last_move4, last_ko_age
465 * - symmetry information
467 * #define QUICK_BOARD_CODE at the top of your file to get compile-time
468 * error if you try to access a forbidden field.
470 * Invalid quick_play()/quick_undo() combinations (missing undo for example)
471 * are caught at next board_play() if BOARD_UNDO_CHECKS is defined.
473 int board_quick_play(struct board
*board
, struct move
*m
, struct board_undo
*u
);
474 void board_quick_undo(struct board
*b
, struct move
*m
, struct board_undo
*u
);
476 /* quick_play() + quick_undo() combo.
477 * Body is executed only if move is valid (silently ignored otherwise).
478 * Can break out in body, but definitely *NOT* return / jump around !
479 * (caught at run time if BOARD_UNDO_CHECKS defined). Can use
480 * with_move_return(val) to return value for non-nested with_move()'s
482 #define with_move(board_, coord_, color_, body_) \
484 struct board *board__ = (board_); /* For with_move_return() */ \
485 struct move m_ = { .coord = (coord_), .color = (color_) }; \
486 struct board_undo u_; \
487 if (board_quick_play(board__, &m_, &u_) >= 0) { \
488 do { body_ } while(0); \
489 board_quick_undo(board__, &m_, &u_); \
493 /* Return value from within with_move() statement.
494 * Valid for non-nested with_move() *ONLY* */
495 #define with_move_return(val_) \
496 do { typeof(val_) val__ = (val_); board_quick_undo(board__, &m_, &u_); return val__; } while (0)
498 /* Same as with_move() but assert out in case of invalid move. */
499 #define with_move_strict(board_, coord_, color_, body_) \
501 struct board *board__ = (board_); /* For with_move_return() */ \
502 struct move m_ = { .coord = (coord_), .color = (color_) }; \
503 struct board_undo u_; \
504 assert (board_quick_play(board__, &m_, &u_) >= 0); \
505 do { body_ } while(0); \
506 board_quick_undo(board__, &m_, &u_); \
512 #define foreach_point(board_) \
515 for (; c < board_size(board_) * board_size(board_); c++)
516 #define foreach_point_and_pass(board_) \
519 for (; c < board_size(board_) * board_size(board_); c++)
520 #define foreach_point_end \
523 #define foreach_free_point(board_) \
525 int fmax__ = (board_)->flen; \
526 for (int f__ = 0; f__ < fmax__; f__++) { \
527 coord_t c = (board_)->f[f__];
528 #define foreach_free_point_end \
532 #define foreach_in_group(board_, group_) \
534 struct board *board__ = board_; \
535 coord_t c = group_base(group_); \
536 coord_t c2 = c; c2 = groupnext_at(board__, c2); \
538 #define foreach_in_group_end \
539 c = c2; c2 = groupnext_at(board__, c2); \
543 /* NOT VALID inside of foreach_point() or another foreach_neighbor(), or rather
544 * on S_OFFBOARD coordinates. */
545 #define foreach_neighbor(board_, coord_, loop_body) \
547 struct board *board__ = board_; \
548 coord_t coord__ = coord_; \
550 c = coord__ - board_size(board__); do { loop_body } while (0); \
551 c = coord__ - 1; do { loop_body } while (0); \
552 c = coord__ + 1; do { loop_body } while (0); \
553 c = coord__ + board_size(board__); do { loop_body } while (0); \
556 #define foreach_8neighbor(board_, coord_) \
559 coord_t c = (coord_); \
560 for (fn__i = 0; fn__i < 8; fn__i++) { \
561 c += (board_)->nei8[fn__i];
562 #define foreach_8neighbor_end \
566 #define foreach_diag_neighbor(board_, coord_) \
569 coord_t c = (coord_); \
570 for (fn__i = 0; fn__i < 4; fn__i++) { \
571 c += (board_)->dnei[fn__i];
572 #define foreach_diag_neighbor_end \
578 board_is_eyelike(struct board
*board
, coord_t coord
, enum stone eye_color
)
580 return (neighbor_count_at(board
, coord
, eye_color
)
581 + neighbor_count_at(board
, coord
, S_OFFBOARD
)) == 4;
584 /* Group suicides allowed */
586 board_is_valid_play(struct board
*board
, enum stone color
, coord_t coord
)
588 if (board_at(board
, coord
) != S_NONE
)
590 if (!board_is_eyelike(board
, coord
, stone_other(color
)))
592 /* Play within {true,false} eye-ish formation */
593 if (board
->ko
.coord
== coord
&& board
->ko
.color
== color
)
596 /* XXX: Disallows suicide. */
597 return trait_at(board
, coord
, color
).cap
> 0;
599 int groups_in_atari
= 0;
600 foreach_neighbor(board
, coord
, {
601 group_t g
= group_at(board
, c
);
602 groups_in_atari
+= (board_group_info(board
, g
).libs
== 1);
604 return !!groups_in_atari
;
608 /* Check group suicides, slower than board_is_valid_play() */
610 board_is_valid_play_no_suicide(struct board
*board
, enum stone color
, coord_t coord
)
612 if (board_at(board
, coord
) != S_NONE
)
614 if (immediate_liberty_count(board
, coord
) >= 1)
616 if (board_is_eyelike(board
, coord
, stone_other(color
)) &&
617 board
->ko
.coord
== coord
&& board
->ko
.color
== color
)
620 // Capturing something ?
622 /* XXX: Disallows suicide. */
623 if (trait_at(board
, coord
, color
).cap
> 0)
626 foreach_neighbor(board
, coord
, {
627 if (board_at(board
, c
) == stone_other(color
) &&
628 board_group_info(board
, group_at(board
, c
)).libs
== 1)
633 // Neighbour with 2 libs ?
634 foreach_neighbor(board
, coord
, {
635 if (board_at(board
, c
) == color
&&
636 board_group_info(board
, group_at(board
, c
)).libs
> 1)
640 return false; // Suicide
645 board_is_valid_move(struct board
*board
, struct move
*m
)
647 return board_is_valid_play(board
, m
->color
, m
->coord
);
651 board_playing_ko_threat(struct board
*b
)
653 return !is_pass(b
->ko
.coord
);
656 static inline group_t
657 board_get_atari_neighbor(struct board
*b
, coord_t coord
, enum stone group_color
)
660 if (!trait_at(b
, coord
, stone_other(group_color
)).cap
) return 0;
662 foreach_neighbor(b
, coord
, {
663 group_t g
= group_at(b
, c
);
664 if (g
&& board_at(b
, c
) == group_color
&& board_group_info(b
, g
).libs
== 1)
666 /* We return first match. */
672 board_safe_to_play(struct board
*b
, coord_t coord
, enum stone color
)
674 /* number of free neighbors */
675 int libs
= immediate_liberty_count(b
, coord
);
680 /* number of capturable enemy groups */
681 if (trait_at(b
, coord
, color
).cap
> 0)
682 return true; // XXX: We don't account for snapback.
683 /* number of non-capturable friendly groups */
684 int noncap_ours
= neighbor_count_at(b
, coord
, color
) - trait_at(b
, coord
, stone_other(color
)).cap
;
690 /* ok, but we need to check if they don't have just two libs. */
692 foreach_neighbor(b
, coord
, {
694 if (board_at(b
, c
) == stone_other(color
) && board_group_info(b
, group_at(b
, c
)).libs
== 1)
695 return true; // can capture; no snapback check
697 if (board_at(b
, c
) != color
) continue;
698 group_t g
= group_at(b
, c
);
699 if (board_group_info(b
, g
).libs
== 1) continue; // in atari
700 if (board_group_info(b
, g
).libs
== 2) { // two liberties
701 if (libs
> 0) return true; // we already have one real liberty
702 /* we might be connecting two 2-lib groups, which is ok;
703 * so remember the other liberty and just make sure it's
704 * not the same one */
705 if (onelib
>= 0 && c
!= onelib
) return true;
706 onelib
= board_group_other_lib(b
, g
, c
);
712 // no good support group
717 group_stone_count(struct board
*b
, group_t group
, int max
)
720 foreach_in_group(b
, group
) {
722 if (n
>= max
) return max
;
723 } foreach_in_group_end
;
727 #ifndef QUICK_BOARD_CODE
729 board_coord_in_symmetry(struct board
*b
, coord_t c
)
731 if (coord_y(c
, b
) < b
->symmetry
.y1
|| coord_y(c
, b
) > b
->symmetry
.y2
)
733 if (coord_x(c
, b
) < b
->symmetry
.x1
|| coord_x(c
, b
) > b
->symmetry
.x2
)
736 int x
= coord_x(c
, b
);
737 if (b
->symmetry
.type
== SYM_DIAG_DOWN
)
738 x
= board_size(b
) - 1 - x
;
739 if (x
> coord_y(c
, b
))