board.h

   1 #ifndef ZZGO_BOARD_H
   2 #define ZZGO_BOARD_H
   3
   4 #include <stdbool.h>
   5 #include <stdint.h>
   6
   7 #include "stone.h"
   8 #include "move.h"
   9
  10 #define likely(x) __builtin_expect(!!(x), 1)
  11 #define unlikely(x) __builtin_expect((x), 0)
  12
  13
  14 /* The board implementation has bunch of optional features.
  15  * Turn them on below: */
  16 #define WANT_BOARD_C // required by playout_moggy
  17 //#define BOARD_SIZE 9 // constant board size, allows better optimization
  18
  19
  20 /* Allow board_play_random_move() to return pass even when
  21  * there are other moves available. */
  22 extern bool random_pass;
  23
  24
  25 /* Some engines might normalize their reading and skip symmetrical
  26  * moves. We will tell them how can they do it. */
  27 struct board_symmetry {
  28         /* Playground is in this rectangle. */
  29         int x1, x2, y1, y2;
  30         /* d ==  0: Full rectangle
  31          * d ==  1: Top triangle */
  32         int d;
  33         /* General symmetry type. */
  34         enum {
  35                 SYM_FULL,
  36                 SYM_DIAG_UP,
  37                 SYM_DIAG_DOWN,
  38                 SYM_HORIZ,
  39                 SYM_VERT,
  40                 SYM_NONE
  41         } type;
  42 };
  43
  44
  45 typedef uint64_t hash_t;
  46
  47
  48 /* Note that "group" is only chain of stones that is solidly
  49  * connected for us. */
  50 typedef coord_t group_t;
  51
  52 struct group {
  53         /* We keep track of only up to GROUP_KEEP_LIBS; over that, we
  54          * don't care. */
  55         /* _Combination_ of these two values can make some difference
  56          * in performance - fine-tune. */
  57 #define GROUP_KEEP_LIBS 10
  58         // refill lib[] only when we hit this; this must be at least 2!
  59         // Moggy requires at least 3 - see below for semantic impact.
  60 #define GROUP_REFILL_LIBS 5
  61         coord_t lib[GROUP_KEEP_LIBS];
  62         /* libs is only LOWER BOUND for the number of real liberties!!!
  63          * It denotes only number of items in lib[], thus you can rely
  64          * on it to store real liberties only up to <= GROUP_REFILL_LIBS. */
  65         int libs;
  66 };
  67
  68 struct neighbor_colors {
  69         char colors[S_MAX];
  70 };
  71
  72 /* You should treat this struct as read-only. Always call functions below if
  73  * you want to change it. */
  74
  75 struct board {
  76         int size; /* Including S_OFFBOARD margin - see below. */
  77         int size2; /* size^2 */
  78         int captures[S_MAX];
  79         float komi;
  80         int handicap;
  81
  82         int moves;
  83         struct move last_move;
  84         /* Whether we tried to add a hash twice; board_play*() can
  85          * set this, but it will still carry out the move as well! */
  86         bool superko_violation;
  87
  88         /* The following two structures are goban maps and are indexed by
  89          * coord.pos. The map is surrounded by a one-point margin from
  90          * S_OFFBOARD stones in order to speed up some internal loops.
  91          * Some of the foreach iterators below might include these points;
  92          * you need to handle them yourselves, if you need to. */
  93
  94         /* Stones played on the board */
  95         enum stone *b; /* enum stone */
  96         /* Group id the stones are part of; 0 == no group */
  97         group_t *g;
  98         /* Positions of next stones in the stone group; 0 == last stone */
  99         coord_t *p;
 100         /* Neighboring colors; numbers of neighbors of index color */
 101         struct neighbor_colors *n;
 102         /* Zobrist hash for each position */
 103         hash_t *h;
 104
 105         /* Group information - indexed by gid (which is coord of base group stone) */
 106         struct group *gi;
 107
 108         /* Positions of free positions - queue (not map) */
 109         /* Note that free position here is any valid move; including single-point eyes! */
 110         coord_t *f; int flen;
 111
 112 #ifdef WANT_BOARD_C
 113         /* Queue of capturable groups */
 114         group_t *c; int clen;
 115 #endif
 116
 117         /* Symmetry information */
 118         struct board_symmetry symmetry;
 119
 120
 121         /* --- PRIVATE DATA --- */
 122
 123         /* Basic ko check */
 124         struct move ko;
 125
 126         /* For superko check: */
 127
 128         /* Board "history" - hashes encountered. Size of the hash should be
 129          * >> board_size^2. */
 130 #define history_hash_bits 12
 131 #define history_hash_mask ((1 << history_hash_bits) - 1)
 132 #define history_hash_prev(i) ((i - 1) & history_hash_mask)
 133 #define history_hash_next(i) ((i + 1) & history_hash_mask)
 134         hash_t history_hash[1 << history_hash_bits];
 135         /* Hash of current board position. */
 136         hash_t hash;
 137 };
 138
 139 #ifdef BOARD_SIZE
 140 /* Avoid unused variable warnings */
 141 #define board_size(b_) (((b_) == (b_)) ? BOARD_SIZE + 2 : 0)
 142 #define board_size2(b_) (board_size(b_) * board_size(b_))
 143 #else
 144 #define board_size(b_) ((b_)->size)
 145 #define board_size2(b_) ((b_)->size2)
 146 #endif
 147
 148 #define board_at(b_, c) ((b_)->b[coord_raw(c)])
 149 #define board_atxy(b_, x, y) ((b_)->b[(x) + board_size(b_) * (y)])
 150
 151 #define group_at(b_, c) ((b_)->g[coord_raw(c)])
 152 #define group_atxy(b_, x, y) ((b_)->g[(x) + board_size(b_) * (y)])
 153
 154 #define neighbor_count_at(b_, coord, color) ((b_)->n[coord_raw(coord)].colors[(enum stone) color])
 155 #define set_neighbor_count_at(b_, coord, color, count) (neighbor_count_at(b_, coord, color) = (count))
 156 #define inc_neighbor_count_at(b_, coord, color) (neighbor_count_at(b_, coord, color)++)
 157 #define dec_neighbor_count_at(b_, coord, color) (neighbor_count_at(b_, coord, color)--)
 158 #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))
 159
 160 #define groupnext_at(b_, c) ((b_)->p[coord_raw(c)])
 161 #define groupnext_atxy(b_, x, y) ((b_)->p[(x) + board_size(b_) * (y)])
 162
 163 #define group_base(g_) (g_)
 164 #define board_group_info(b_, g_) ((b_)->gi[(g_)])
 165 #define board_group_captured(b_, g_) (board_group_info(b_, g_).libs == 0)
 166
 167 #define hash_at(b_, coord, color) (b_)->h[((color) == S_BLACK ? board_size2(b_) : 0) + coord_raw(coord)]
 168
 169 struct board *board_init(void);
 170 struct board *board_copy(struct board *board2, struct board *board1);
 171 void board_done_noalloc(struct board *board);
 172 void board_done(struct board *board);
 173 /* size here is without the S_OFFBOARD margin. */
 174 void board_resize(struct board *board, int size);
 175 void board_clear(struct board *board);
 176
 177 struct FILE;
 178 void board_print(struct board *board, FILE *f);
 179
 180 /* Place given handicap on the board; coordinates are printed to f. */
 181 void board_handicap(struct board *board, int stones, FILE *f);
 182
 183 /* Returns group id, 0 on allowed suicide, pass or resign, -1 on error */
 184 int board_play(struct board *board, struct move *m);
 185 /* Like above, but plays random move; the move coordinate is recorded
 186  * to *coord. This method will never fill your own eye. pass is played
 187  * when no move can be played. */
 188 void board_play_random(struct board *b, enum stone color, coord_t *coord);
 189
 190 /* Adjust symmetry information as if given coordinate has been played. */
 191 void board_symmetry_update(struct board *b, struct board_symmetry *symmetry, coord_t c);
 192
 193 /* Returns true if given coordinate has all neighbors of given color or the edge. */
 194 bool board_is_eyelike(struct board *board, coord_t *coord, enum stone eye_color);
 195 /* Returns true if given coordinate is a 1-pt eye (checks against false eyes, or
 196  * at least tries to). */
 197 bool board_is_one_point_eye(struct board *board, coord_t *c, enum stone eye_color);
 198 /* Returns color of a 1pt eye owner, S_NONE if not an eye. */
 199 enum stone board_get_one_point_eye(struct board *board, coord_t *c);
 200
 201 /* Check if group is in atari. This is very fast.
 202  * The last liberty is recorded to lastlib (content is undefined if group
 203  * is not in atari). */
 204 bool board_group_in_atari(struct board *board, group_t group, coord_t *lastlib);
 205
 206 /* Check if group can be put in atari. This is also very fast.
 207  * The last two liberties are recorded to lastlib (content is undefined if group
 208  * can't be put in atari). */
 209 bool board_group_can_atari(struct board *board, group_t group, coord_t lastlib[2]);
 210
 211 /* board_official_score() is the scoring method for yielding score suitable
 212  * for external presentation. For fast scoring of entirely filled boards
 213  * (e.g. playouts), use board_fast_score(). */
 214 /* Positive: W wins */
 215 /* Tromp-Taylor scoring. */
 216 float board_official_score(struct board *board);
 217 /* Compare number of stones + 1pt eyes. */
 218 float board_fast_score(struct board *board);
 219
 220 /* Assess if it is desirable to pull out from atari
 221  * by this move. */
 222 bool valid_escape_route(struct board *b, enum stone color, coord_t to);
 223
 224 /* Checks if there are any stones in n-vincinity of coord. */
 225 bool board_stone_radar(struct board *b, coord_t coord, int distance);
 226
 227
 228 /** Iterators */
 229
 230 #define foreach_point(board_) \
 231         do { \
 232                 coord_t c; coord_pos(c, 0, (board_)); \
 233                 for (; coord_raw(c) < board_size(board_) * board_size(board_); coord_raw(c)++)
 234 #define foreach_point_end \
 235         } while (0)
 236
 237 #define foreach_in_group(board_, group_) \
 238         do { \
 239                 struct board *board__ = board_; \
 240                 coord_t c = group_base(group_); \
 241                 coord_t c2 = c; coord_raw(c2) = groupnext_at(board__, c2); \
 242                 do {
 243 #define foreach_in_group_end \
 244                         c = c2; coord_raw(c2) = groupnext_at(board__, c2); \
 245                 } while (coord_raw(c) != 0); \
 246         } while (0)
 247
 248 /* NOT VALID inside of foreach_point() or another foreach_neighbor(), or rather
 249  * on S_OFFBOARD coordinates. */
 250 #define foreach_neighbor(board_, coord_, loop_body) \
 251         do { \
 252                 struct board *board__ = board_; \
 253                 coord_t coord__ = coord_; \
 254                 coord_t c; \
 255                 coord_pos(c, coord_raw(coord__) - 1, (board__)); do { loop_body } while (0); \
 256                 coord_pos(c, coord_raw(coord__) - board_size(board__), (board__)); do { loop_body } while (0); \
 257                 coord_pos(c, coord_raw(coord__) + 1, (board__)); do { loop_body } while (0); \
 258                 coord_pos(c, coord_raw(coord__) + board_size(board__), (board__)); do { loop_body } while (0); \
 259         } while (0)
 260
 261 #define foreach_diag_neighbor(board_, coord_) \
 262         do { \
 263                 coord_t q__[4]; int q__i = 0; \
 264                 coord_pos(q__[q__i++], coord_raw(coord_) - board_size(board_) - 1, (board_)); \
 265                 coord_pos(q__[q__i++], coord_raw(coord_) - board_size(board_) + 1, (board_)); \
 266                 coord_pos(q__[q__i++], coord_raw(coord_) + board_size(board_) - 1, (board_)); \
 267                 coord_pos(q__[q__i++], coord_raw(coord_) + board_size(board_) + 1, (board_)); \
 268                 int fn__i; \
 269                 for (fn__i = 0; fn__i < q__i; fn__i++) { \
 270                         coord_t c = q__[fn__i];
 271 #define foreach_diag_neighbor_end \
 272                 } \
 273         } while (0)
 274
 275
 276 #endif