tactics.c

   1 #include <assert.h>
   2 #include <stdio.h>
   3 #include <stdlib.h>
   4
   5 #define DEBUG
   6 #include "board.h"
   7 #include "debug.h"
   8 #include "tactics.h"
   9
  10
  11 struct selfatari_state {
  12         int groupcts[S_MAX];
  13         group_t groupids[S_MAX][4];
  14
  15         /* This is set if this move puts a group out of _all_
  16          * liberties; we need to watch out for snapback then. */
  17         bool friend_has_no_libs;
  18         /* We may have one liberty, but be looking for one more.
  19          * In that case, @needs_more_lib is id of group
  20          * already providing one, don't consider it again. */
  21         group_t needs_more_lib;
  22         /* ID of the first liberty, providing it again is not
  23          * interesting. */
  24         coord_t needs_more_lib_except;
  25 };
  26
  27 static int
  28 examine_friendly_groups(struct board *b, enum stone color, coord_t to, struct selfatari_state *s)
  29 {
  30         for (int i = 0; i < s->groupcts[color]; i++) {
  31                 /* We can escape by connecting to this group if it's
  32                  * not in atari. */
  33                 group_t g = s->groupids[color][i];
  34
  35                 if (board_group_info(b, g).libs == 1) {
  36                         if (!s->needs_more_lib)
  37                                 s->friend_has_no_libs = true;
  38                         // or we already have a friend with 1 lib
  39                         continue;
  40                 }
  41
  42                 /* Could we self-atari the group here? */
  43                 if (board_group_info(b, g).libs > 2)
  44                         return false;
  45
  46                 /* We need to have another liberty, and
  47                  * it must not be the other liberty of
  48                  * the group. */
  49                 int lib2 = board_group_other_lib(b, g, to);
  50                 /* Maybe we already looked at another
  51                  * group providing one liberty? */
  52                 if (s->needs_more_lib && s->needs_more_lib != g
  53                     && s->needs_more_lib_except != lib2)
  54                         return false;
  55
  56                 /* Can we get the liberty locally? */
  57                 /* Yes if we are route to more liberties... */
  58                 if (s->groupcts[S_NONE] > 1)
  59                         return false;
  60                 /* ...or one liberty, but not lib2. */
  61                 if (s->groupcts[S_NONE] > 0
  62                     && !coord_is_adjecent(lib2, to, b))
  63                         return false;
  64
  65                 /* ...ok, then we can still contribute a liberty
  66                  * later by capturing something. */
  67                 s->needs_more_lib = g;
  68                 s->needs_more_lib_except = lib2;
  69                 s->friend_has_no_libs = false;
  70         }
  71
  72         return -1;
  73 }
  74
  75 static int
  76 examine_enemy_groups(struct board *b, enum stone color, coord_t to, struct selfatari_state *s)
  77 {
  78         /* We may be able to gain a liberty by capturing this group. */
  79         group_t can_capture = 0;
  80
  81         /* Examine enemy groups: */
  82         for (int i = 0; i < s->groupcts[stone_other(color)]; i++) {
  83                 /* We can escape by capturing this group if it's in atari. */
  84                 group_t g = s->groupids[stone_other(color)][i];
  85                 if (board_group_info(b, g).libs > 1)
  86                         continue;
  87
  88                 /* But we need to get to at least two liberties by this;
  89                  * we already have one outside liberty, or the group is
  90                  * more than 1 stone (in that case, capturing is always
  91                  * nice!). */
  92                 if (s->groupcts[S_NONE] > 0 || !group_is_onestone(b, g))
  93                         return false;
  94                 /* ...or, it's a ko stone, */
  95                 if (neighbor_count_at(b, g, color) + neighbor_count_at(b, g, S_OFFBOARD) == 3) {
  96                         /* and we don't have a group to save: then, just taking
  97                          * single stone means snapback! */
  98                         if (!s->friend_has_no_libs)
  99                                 return false;
 100                 }
 101                 /* ...or, we already have one indirect liberty provided
 102                  * by another group. */
 103                 if (s->needs_more_lib || (can_capture && can_capture != g))
 104                         return false;
 105                 can_capture = g;
 106
 107         }
 108
 109         if (DEBUGL(6))
 110                 fprintf(stderr, "no cap group\n");
 111
 112         if (!s->needs_more_lib && !can_capture && !s->groupcts[S_NONE]) {
 113                 /* We have no hope for more fancy tactics - this move is simply
 114                  * a suicide, not even a self-atari. */
 115                 if (DEBUGL(6))
 116                         fprintf(stderr, "suicide\n");
 117                 return true;
 118         }
 119         /* XXX: I wonder if it makes sense to continue if we actually
 120          * just !s->needs_more_lib. */
 121
 122         return -1;
 123 }
 124
 125 static int
 126 setup_nakade_or_snapback(struct board *b, enum stone color, coord_t to, struct selfatari_state *s)
 127 {
 128         /* There is another possibility - we can self-atari if it is
 129          * a nakade: we put an enemy group in atari from the inside. */
 130         /* This branch also allows eyes falsification:
 131          * O O O . .  (This is different from throw-in to false eye
 132          * X X O O .  checked below in that there is no X stone at the
 133          * X . X O .  right of the star point in this diagram.)
 134          * X X X O O
 135          * X O * . . */
 136         /* TODO: Allow to only nakade if the created shape is dead
 137          * (http://senseis.xmp.net/?Nakade). */
 138
 139         /* This branch also covers snapback, which is kind of special
 140          * nakade case. ;-) */
 141         for (int i = 0; i < s->groupcts[stone_other(color)]; i++) {
 142                 group_t g = s->groupids[stone_other(color)][i];
 143                 if (board_group_info(b, g).libs != 2)
 144                         goto next_group;
 145                 /* Simple check not to re-examine the same group. */
 146                 if (i > 0 && s->groupids[stone_other(color)][i] == s->groupids[stone_other(color)][i - 1])
 147                         continue;
 148
 149                 /* We must make sure the other liberty of that group:
 150                  * (i) is an internal liberty
 151                  * (ii) filling it to capture our group will not gain
 152                  * safety */
 153
 154                 /* Let's look at neighbors of the other liberty: */
 155                 int lib2 = board_group_other_lib(b, g, to);
 156                 foreach_neighbor(b, lib2, {
 157                         /* This neighbor of course does not contribute
 158                          * anything to the enemy. */
 159                         if (board_at(b, c) == S_OFFBOARD)
 160                                 continue;
 161
 162                         /* If the other liberty has empty neighbor,
 163                          * it must be the original liberty; otherwise,
 164                          * since the whole group has only 2 liberties,
 165                          * the other liberty may not be internal and
 166                          * we are nakade'ing eyeless group from outside,
 167                          * which is stupid. */
 168                         if (board_at(b, c) == S_NONE) {
 169                                 if (c == to)
 170                                         continue;
 171                                 else
 172                                         goto next_group;
 173                         }
 174
 175                         int g2 = group_at(b, c);
 176                         /* If the neighbor is of our color, it must
 177                          * be also a 2-lib group. If it is more,
 178                          * we CERTAINLY want that liberty to be played
 179                          * first, what if it is an alive group? If it
 180                          * is in atari, we want to extend from it to
 181                          * prevent eye-making capture. However, if it
 182                          * is 2-lib, it is selfatari connecting two
 183                          * nakade'ing groups! */
 184                         /* X X X X  We will not allow play on 'a',
 185                          * X X a X  because 'b' would capture two
 186                          * X O b X  different groups, forming two
 187                          * X X X X  eyes. */
 188                         if (board_at(b, c) == color) {
 189                                 if (board_group_info(b, group_at(b, c)).libs == 2)
 190                                         continue;
 191                                 goto next_group;
 192                         }
 193
 194                         /* The neighbor is enemy color. It's ok if
 195                          * it's still the same group or this is its
 196                          * only liberty. */
 197                         if (g == g2 || board_group_info(b, g2).libs == 1)
 198                                 continue;
 199                         /* Otherwise, it must have the exact same
 200                          * liberties as the original enemy group. */
 201                         if (board_group_info(b, g2).libs == 2
 202                             && (board_group_info(b, g2).lib[0] == to
 203                                 || board_group_info(b, g2).lib[1] == to))
 204                                 continue;
 205
 206                         goto next_group;
 207                 });
 208
 209                 /* Now, we must distinguish between nakade and eye
 210                  * falsification; we must not falsify an eye by more
 211                  * than two stones. */
 212                 if (s->groupcts[color] < 1)
 213                         return false; // simple throw-in
 214                 if (s->groupcts[color] == 1 && group_is_onestone(b, s->groupids[color][0])) {
 215                         /* More complex throw-in - we are in one of
 216                          * three situations:
 217                          * a O O O O X  b O O O X  c O O O X
 218                          *   O . X . O    O X . .    O . X .
 219                          *   # # # # #    # # # #    # # # #
 220                          * b is desirable here (since maybe O has no
 221                          * backup two eyes); a may be desirable, but
 222                          * is tested next in check_throwin(). c is
 223                          * never desirable. */
 224                         group_t g2 = s->groupids[color][0];
 225                         assert(board_group_info(b, g2).libs <= 2);
 226                         if (board_group_info(b, g2).libs == 1)
 227                                 return false; // b
 228                         goto next_group; // a or c
 229                 }
 230
 231                 /* We would create more than 2-stone group; in that
 232                  * case, the liberty of our result must be lib2,
 233                  * indicating this really is a nakade. */
 234                 for (int j = 0; j < s->groupcts[color]; j++) {
 235                         group_t g2 = s->groupids[color][j];
 236                         assert(board_group_info(b, g2).libs <= 2);
 237                         if (board_group_info(b, g2).libs == 2) {
 238                                 if (board_group_info(b, g2).lib[0] != lib2
 239                                     && board_group_info(b, g2).lib[1] != lib2)
 240                                         goto next_group;
 241                         } else {
 242                                 assert(board_group_info(b, g2).lib[0] == to);
 243                         }
 244                 }
 245
 246                 return false;
 247 next_group:
 248                 /* Unless we are dealing with snapback setup, we don't need to look
 249                  * further. */
 250                 if (s->groupcts[color])
 251                         return -1;
 252         }
 253
 254         return -1;
 255 }
 256
 257 static int
 258 check_throwin(struct board *b, enum stone color, coord_t to, struct selfatari_state *s)
 259 {
 260         /* We can be throwing-in to false eye:
 261          * X X X O X X X O X X X X X
 262          * X . * X * O . X * O O . X
 263          * # # # # # # # # # # # # # */
 264         /* We cannot sensibly throw-in into a corner. */
 265         if (neighbor_count_at(b, to, S_OFFBOARD) < 2
 266             && neighbor_count_at(b, to, stone_other(color))
 267                + neighbor_count_at(b, to, S_OFFBOARD) == 3
 268             && board_is_false_eyelike(b, to, stone_other(color))) {
 269                 assert(s->groupcts[color] <= 1);
 270                 /* Single-stone throw-in may be ok... */
 271                 if (s->groupcts[color] == 0) {
 272                         /* O X .  There is one problem - when it's
 273                          * . * X  actually not a throw-in!
 274                          * # # #  */
 275                         foreach_neighbor(b, to, {
 276                                 if (board_at(b, c) == S_NONE) {
 277                                         /* Is the empty neighbor an escape path? */
 278                                         /* (Note that one S_NONE neighbor is already @to.) */
 279                                         if (neighbor_count_at(b, c, stone_other(color))
 280                                             + neighbor_count_at(b, c, S_OFFBOARD) < 2)
 281                                                 return -1;
 282                                 }
 283                         });
 284                         return false;
 285                 }
 286
 287                 /* Multi-stone throwin...? */
 288                 assert(s->groupcts[color] == 1);
 289                 group_t g = s->groupids[color][0];
 290
 291                 assert(board_group_info(b, g).libs <= 2);
 292                 /* Suicide is definitely NOT ok, no matter what else
 293                  * we could test. */
 294                 if (board_group_info(b, g).libs == 1)
 295                         return true;
 296
 297                 /* In that case, we must be connected to at most one stone,
 298                  * or throwin will not destroy any eyes. */
 299                 if (group_is_onestone(b, g))
 300                         return false;
 301         }
 302         return -1;
 303 }
 304
 305 bool
 306 is_bad_selfatari_slow(struct board *b, enum stone color, coord_t to)
 307 {
 308         if (DEBUGL(5))
 309                 fprintf(stderr, "sar check %s %s\n", stone2str(color), coord2sstr(to, b));
 310         /* Assess if we actually gain any liberties by this escape route.
 311          * Note that this is not 100% as we cannot check whether we are
 312          * connecting out or just to ourselves. */
 313
 314         struct selfatari_state s;
 315         memset(&s, 0, sizeof(s));
 316         int d;
 317
 318         foreach_neighbor(b, to, {
 319                 enum stone color = board_at(b, c);
 320                 s.groupids[color][s.groupcts[color]++] = group_at(b, c);
 321         });
 322
 323         /* We have shortage of liberties; that's the point. */
 324         assert(s.groupcts[S_NONE] <= 1);
 325
 326         d = examine_friendly_groups(b, color, to, &s);
 327         if (d >= 0)
 328                 return d;
 329
 330         if (DEBUGL(6))
 331                 fprintf(stderr, "no friendly group\n");
 332
 333         d = examine_enemy_groups(b, color, to, &s);
 334         if (d >= 0)
 335                 return d;
 336
 337         if (DEBUGL(6))
 338                 fprintf(stderr, "no escape\n");
 339
 340         d = setup_nakade_or_snapback(b, color, to, &s);
 341         if (d >= 0)
 342                 return d;
 343
 344         if (DEBUGL(6))
 345                 fprintf(stderr, "no nakade group\n");
 346
 347         d = check_throwin(b, color, to, &s);
 348         if (d >= 0)
 349                 return d;
 350
 351         if (DEBUGL(6))
 352                 fprintf(stderr, "no throw-in group\n");
 353
 354         /* No way to pull out, no way to connect out. This really
 355          * is a bad self-atari! */
 356         return true;
 357 }
 358
 359
 360 /* Is this ladder breaker friendly for the one who catches ladder. */
 361 static bool
 362 ladder_catcher(struct board *b, int x, int y, enum stone laddered)
 363 {
 364         enum stone breaker = board_atxy(b, x, y);
 365         return breaker == stone_other(laddered) || breaker == S_OFFBOARD;
 366 }
 367
 368 bool
 369 is_border_ladder(struct board *b, coord_t coord, enum stone lcolor)
 370 {
 371         int x = coord_x(coord, b), y = coord_y(coord, b);
 372
 373         if (DEBUGL(5))
 374                 fprintf(stderr, "border ladder\n");
 375         /* Direction along border; xd is horiz. border, yd vertical. */
 376         int xd = 0, yd = 0;
 377         if (board_atxy(b, x + 1, y) == S_OFFBOARD || board_atxy(b, x - 1, y) == S_OFFBOARD)
 378                 yd = 1;
 379         else
 380                 xd = 1;
 381         /* Direction from the border; -1 is above/left, 1 is below/right. */
 382         int dd = (board_atxy(b, x + yd, y + xd) == S_OFFBOARD) ? 1 : -1;
 383         if (DEBUGL(6))
 384                 fprintf(stderr, "xd %d yd %d dd %d\n", xd, yd, dd);
 385         /* | ? ?
 386          * | . O #
 387          * | c X #
 388          * | . O #
 389          * | ? ?   */
 390         /* This is normally caught, unless we have friends both above
 391          * and below... */
 392         if (board_atxy(b, x + xd * 2, y + yd * 2) == lcolor
 393             && board_atxy(b, x - xd * 2, y - yd * 2) == lcolor)
 394                 return false;
 395         /* ...or can't block where we need because of shortage
 396          * of liberties. */
 397         int libs1 = board_group_info(b, group_atxy(b, x + xd - yd * dd, y + yd - xd * dd)).libs;
 398         int libs2 = board_group_info(b, group_atxy(b, x - xd - yd * dd, y - yd - xd * dd)).libs;
 399         if (DEBUGL(6))
 400                 fprintf(stderr, "libs1 %d libs2 %d\n", libs1, libs2);
 401         if (libs1 < 2 && libs2 < 2)
 402                 return false;
 403         if (board_atxy(b, x + xd * 2, y + yd * 2) == lcolor && libs1 < 3)
 404                 return false;
 405         if (board_atxy(b, x - xd * 2, y - yd * 2) == lcolor && libs2 < 3)
 406                 return false;
 407         return true;
 408 }
 409
 410 /* This is very trivial and gets a lot of corner cases wrong.
 411  * We need this to be just very fast. One important point is
 412  * that we sometimes might not notice a ladder but if we do,
 413  * it should always work; thus we can use this for strong
 414  * negative hinting safely. */
 415 bool
 416 is_middle_ladder(struct board *b, coord_t coord, enum stone lcolor)
 417 {
 418         int x = coord_x(coord, b), y = coord_y(coord, b);
 419
 420         /* Figure out the ladder direction */
 421         int xd, yd;
 422         xd = board_atxy(b, x + 1, y) == S_NONE ? 1 : board_atxy(b, x - 1, y) == S_NONE ? -1 : 0;
 423         yd = board_atxy(b, x, y + 1) == S_NONE ? 1 : board_atxy(b, x, y - 1) == S_NONE ? -1 : 0;
 424
 425         if (!xd || !yd) {
 426                 if (DEBUGL(5))
 427                         fprintf(stderr, "no ladder, too little space; self-atari?\n");
 428                 return false;
 429         }
 430
 431         /* For given (xd,yd), we have two possibilities where to move
 432          * next. Consider (-1,-1):
 433          * n X .   n c X
 434          * c O X   X O #
 435          * X # #   . X #
 436          */
 437         bool horiz_first = ladder_catcher(b, x, y - yd, lcolor); // left case
 438         bool vert_first = ladder_catcher(b, x - xd, y, lcolor); // right case
 439
 440         /* We don't have to look at the other 'X' in the position - if it
 441          * wouldn't be there, the group wouldn't be in atari. */
 442
 443         /* We do only tight ladders, not loose ladders. Furthermore,
 444          * the ladders need to be simple:
 445          * . X .             . . X
 446          * c O X supported   . c O unsupported
 447          * X # #             X O #
 448          */
 449         assert(!(horiz_first && vert_first));
 450         if (!horiz_first && !vert_first) {
 451                 /* TODO: In case of basic non-simple ladder, play out both variants. */
 452                 if (DEBUGL(5))
 453                         fprintf(stderr, "non-simple ladder\n");
 454                 return false;
 455         }
 456
 457         /* We do that below for further moves, but now initially - check
 458          * that at 'c', we aren't putting any of the catching stones
 459          * in atari. */
 460 #if 1 // this might be broken?
 461 #define check_catcher_danger(b, x_, y_) do { \
 462         if (board_atxy(b, (x_), (y_)) != S_OFFBOARD \
 463             && board_group_info(b, group_atxy(b, (x_), (y_))).libs <= 2) { \
 464                 if (DEBUGL(5)) \
 465                         fprintf(stderr, "ladder failed - atari at the beginning\n"); \
 466                 return false; \
 467         } } while (0)
 468
 469         if (horiz_first) {
 470                 check_catcher_danger(b, x, y - yd);
 471                 check_catcher_danger(b, x - xd, y + yd);
 472         } else {
 473                 check_catcher_danger(b, x - xd, y);
 474                 check_catcher_danger(b, x + xd, y - yd);
 475         }
 476 #undef check_catcher_danger
 477 #endif
 478
 479 #define ladder_check(xd1_, yd1_, xd2_, yd2_, xd3_, yd3_)        \
 480         if (board_atxy(b, x, y) != S_NONE) { \
 481                 /* Did we hit a stone when playing out ladder? */ \
 482                 if (ladder_catcher(b, x, y, lcolor)) \
 483                         return true; /* ladder works */ \
 484                 if (board_group_info(b, group_atxy(b, x, y)).lib[0] > 0) \
 485                         return false; /* friend that's not in atari himself */ \
 486         } else { \
 487                 /* No. So we are at new position. \
 488                  * We need to check indirect ladder breakers. */ \
 489                 /* . 2 x 3 . \
 490                  * . x o O 1 <- only at O we can check for o at 2 \
 491                  * x o o x .    otherwise x at O would be still deadly \
 492                  * o o x . . \
 493                  * We check for o and x at 1, these are vital. \
 494                  * We check only for o at 2; x at 2 would mean we \
 495                  * need to fork (one step earlier). */ \
 496                 coord_t c1 = coord_xy(b, x + (xd1_), y + (yd1_)); \
 497                 enum stone s1 = board_at(b, c1); \
 498                 if (s1 == lcolor) return false; \
 499                 if (s1 == stone_other(lcolor)) { \
 500                         /* One more thing - if the position at 3 is \
 501                          * friendly and safe, we escaped anyway! */ \
 502                         coord_t c3 = coord_xy(b, x + (xd3_), y + (yd3_)); \
 503                         return board_at(b, c3) != lcolor \
 504                                || board_group_info(b, group_at(b, c3)).libs < 2; \
 505                 } \
 506                 enum stone s2 = board_atxy(b, x + (xd2_), y + (yd2_)); \
 507                 if (s2 == lcolor) return false; \
 508                 /* Then, can X actually "play" 1 in the ladder? */ \
 509                 if (neighbor_count_at(b, c1, lcolor) + neighbor_count_at(b, c1, S_OFFBOARD) >= 2) \
 510                         return false; /* It would be self-atari! */ \
 511         }
 512 #define ladder_horiz    do { if (DEBUGL(6)) fprintf(stderr, "%d,%d horiz step (%d,%d)\n", x, y, xd, yd); x += xd; ladder_check(xd, 0, -2 * xd, yd, 0, yd); } while (0)
 513 #define ladder_vert     do { if (DEBUGL(6)) fprintf(stderr, "%d,%d vert step of (%d,%d)\n", x, y, xd, yd); y += yd; ladder_check(0, yd, xd, -2 * yd, xd, 0); } while (0)
 514
 515         if (ladder_catcher(b, x - xd, y, lcolor))
 516                 ladder_horiz;
 517         do {
 518                 ladder_vert;
 519                 ladder_horiz;
 520         } while (1);
 521 }
 522
 523
 524 bool
 525 board_stone_radar(struct board *b, coord_t coord, int distance)
 526 {
 527         int bounds[4] = {
 528                 coord_x(coord, b) - distance,
 529                 coord_y(coord, b) - distance,
 530                 coord_x(coord, b) + distance,
 531                 coord_y(coord, b) + distance
 532         };
 533         for (int i = 0; i < 4; i++)
 534                 if (bounds[i] < 1)
 535                         bounds[i] = 1;
 536                 else if (bounds[i] > board_size(b) - 2)
 537                         bounds[i] = board_size(b) - 2;
 538         for (int x = bounds[0]; x <= bounds[2]; x++)
 539                 for (int y = bounds[1]; y <= bounds[3]; y++)
 540                         if (board_atxy(b, x, y) != S_NONE) {
 541                                 /* fprintf(stderr, "radar %d,%d,%d: %d,%d (%d)\n",
 542                                         coord_x(coord, b), coord_y(coord, b),
 543                                         distance, x, y, board_atxy(b, x, y)); */
 544                                 return true;
 545                         }
 546         return false;
 547 }
 548
 549
 550 void
 551 cfg_distances(struct board *b, coord_t start, int *distances, int maxdist)
 552 {
 553         /* Queue for d+1 spots; no two spots of the same group
 554          * should appear in the queue. */
 555 #define qinc(x) (x = ((x + 1) >= board_size2(b) ? ((x) + 1 - board_size2(b)) : (x) + 1))
 556         coord_t queue[board_size2(b)]; int qstart = 0, qstop = 0;
 557
 558         foreach_point(b) {
 559                 distances[c] = board_at(b, c) == S_OFFBOARD ? maxdist + 1 : -1;
 560         } foreach_point_end;
 561
 562         queue[qstop++] = start;
 563         for (int d = 0; d <= maxdist; d++) {
 564                 /* Process queued moves, while setting the queue
 565                  * for new wave. */
 566                 int qa = qstart, qb = qstop;
 567                 qstart = qstop;
 568                 for (int q = qa; q < qb; qinc(q)) {
 569 #define cfg_one(coord, grp) do {\
 570         distances[coord] = d; \
 571         foreach_neighbor (b, coord, { \
 572                 if (distances[c] < 0 && (!grp || group_at(b, coord) != grp)) { \
 573                         queue[qstop] = c; \
 574                         qinc(qstop); \
 575                 } \
 576         }); \
 577 } while (0)
 578                         coord_t cq = queue[q];
 579                         if (distances[cq] >= 0)
 580                                 continue; /* We already looked here. */
 581                         if (board_at(b, cq) == S_NONE) {
 582                                 cfg_one(cq, 0);
 583                         } else {
 584                                 group_t g = group_at(b, cq);
 585                                 foreach_in_group(b, g) {
 586                                         cfg_one(c, g);
 587                                 } foreach_in_group_end;
 588                         }
 589 #undef cfg_one
 590                 }
 591         }
 592
 593         foreach_point(b) {
 594                 if (distances[c] < 0)
 595                         distances[c] = maxdist + 1;
 596         } foreach_point_end;
 597 }
 598
 599
 600 float
 601 board_effective_handicap(struct board *b, int first_move_value)
 602 {
 603         /* This can happen if the opponent passes during handicap
 604          * placing phase. */
 605         // assert(b->handicap != 1);
 606         return (b->handicap ? b->handicap : 1) * first_move_value + 0.5 - b->komi;
 607 }
 608
 609
 610 bool
 611 pass_is_safe(struct board *b, enum stone color, struct move_queue *mq)
 612 {
 613         float score = board_official_score(b, mq);
 614         if (color == S_BLACK)
 615                 score = -score;
 616         //fprintf(stderr, "%d score %f\n", color, score);
 617         return (score > 0);
 618 }
 619
 620
 621 /* On average 25% of points remain empty at the end of a game */
 622 #define EXPECTED_FINAL_EMPTY_PERCENT 25
 623
 624 /* Returns estimated number of remaining moves for one player until end of game. */
 625 int
 626 board_estimated_moves_left(struct board *b)
 627 {
 628         int total_points = (board_size(b)-2)*(board_size(b)-2);
 629         int moves_left = (b->flen - total_points*EXPECTED_FINAL_EMPTY_PERCENT/100)/2;
 630         return moves_left > MIN_MOVES_LEFT ? moves_left : MIN_MOVES_LEFT;
 631 }