playout/moggy.c

   1 /* Heuristical playout (and tree prior) policy modelled primarily after
   2  * the description of the Mogo engine. */
   3
   4 #include <assert.h>
   5 #include <math.h>
   6 #include <stdio.h>
   7 #include <stdlib.h>
   8
   9 #define DEBUG
  10 #include "board.h"
  11 #include "debug.h"
  12 #include "joseki/base.h"
  13 #include "libmap.h"
  14 #include "mq.h"
  15 #include "pattern3.h"
  16 #include "playout.h"
  17 #include "playout/moggy.h"
  18 #include "random.h"
  19 #include "tactics/1lib.h"
  20 #include "tactics/2lib.h"
  21 #include "tactics/nlib.h"
  22 #include "tactics/ladder.h"
  23 #include "tactics/nakade.h"
  24 #include "tactics/selfatari.h"
  25 #include "uct/prior.h"
  26
  27 #define PLDEBUGL(n) DEBUGL_(p->debug_level, n)
  28
  29
  30 /* In case "seqchoose" move picker is enabled (i.e. no "fullchoose"
  31  * parameter passed), we stochastically apply fixed set of decision
  32  * rules in given order.
  33  *
  34  * In "fullchoose" mode, we instead build a move queue of variously
  35  * tagged candidates, then consider a probability distribution over
  36  * them and pick a move from that. */
  37
  38 /* Move queue tags. Some may be even undesirable - these moves then
  39  * receive a penalty; penalty tags should be used only when it is
  40  * certain the move would be considered anyway. */
  41 enum mq_tag {
  42         MQ_KO = 0,
  43         MQ_LATARI,
  44         MQ_L2LIB,
  45 #define MQ_LADDER MQ_L2LIB /* XXX: We want to fit in char still! */
  46         MQ_LNLIB,
  47         MQ_PAT3,
  48         MQ_GATARI,
  49         MQ_JOSEKI,
  50         MQ_NAKADE,
  51         MQ_MAX
  52 };
  53
  54
  55 /* Note that the context can be shared by multiple threads! */
  56
  57 struct moggy_policy {
  58         unsigned int lcapturerate, atarirate, nlibrate, ladderrate, capturerate, patternrate, korate, josekirate, nakaderate;
  59         unsigned int selfatarirate, eyefillrate, alwaysccaprate;
  60         unsigned int fillboardtries;
  61         int koage;
  62         /* Whether to look for patterns around second-to-last move. */
  63         bool pattern2;
  64         /* Whether, when self-atari attempt is detected, to play the other
  65          * group's liberty if that is non-self-atari. */
  66         bool selfatari_other;
  67         /* Whether to read out ladders elsewhere than near the board
  68          * in the playouts. Note that such ladder testing is currently
  69          * a fairly expensive operation. */
  70         bool middle_ladder;
  71
  72         /* 1lib settings: */
  73         /* Whether to always pick from moves capturing all groups in
  74          * global_atari_check(). */
  75         bool capcheckall;
  76         /* Prior stone weighting. Weight of each stone between
  77          * cap_stone_min and cap_stone_max is (assess*100)/cap_stone_denom. */
  78         int cap_stone_min, cap_stone_max;
  79         int cap_stone_denom;
  80
  81         /* 2lib settings: */
  82         bool atari_def_no_hopeless;
  83         bool atari_miaisafe;
  84
  85         /* nlib settings: */
  86         int nlib_count;
  87
  88         struct joseki_dict *jdict;
  89         struct pattern3s patterns;
  90
  91         /* Gamma values for queue tags - correspond to probabilities. */
  92         /* XXX: Tune. */
  93         double mq_prob[MQ_MAX], tenuki_prob;
  94 };
  95
  96
  97 static char moggy_patterns_src[][11] = {
  98         /* hane pattern - enclosing hane */
  99         "XOX"
 100         "..."
 101         "???",
 102         /* hane pattern - non-cutting hane */
 103         "YO."
 104         "..."
 105         "?.?",
 106         /* hane pattern - magari */
 107         "XO?"
 108         "X.."
 109         "x.?",
 110         /* hane pattern - thin hane */
 111         "XOO"
 112         "..."
 113         "?.?" "X",
 114         /* generic pattern - katatsuke or diagonal attachment; similar to magari */
 115         ".Q."
 116         "Y.."
 117         "...",
 118         /* cut1 pattern (kiri) - unprotected cut */
 119         "XO?"
 120         "O.o"
 121         "?o?",
 122         /* cut1 pattern (kiri) - peeped cut */
 123         "XO?"
 124         "O.X"
 125         "???",
 126         /* cut2 pattern (de) */
 127         "?X?"
 128         "O.O"
 129         "ooo",
 130         /* cut keima (not in Mogo) */
 131         "OX?"
 132         "o.O"
 133         "???", /* o?? has some pathological tsumego cases */
 134         /* side pattern - chase */
 135         "X.?"
 136         "O.?"
 137         "##?",
 138         /* side pattern - block side cut */
 139         "OX?"
 140         "X.O"
 141         "###",
 142         /* side pattern - block side connection */
 143         "?X?"
 144         "x.O"
 145         "###",
 146         /* side pattern - sagari (SUSPICIOUS) */
 147         "?XQ"
 148         "x.x" /* Mogo has "x.?" */
 149         "###" /* Mogo has "X" */,
 150         /* side pattern - throw-in (SUSPICIOUS) */
 151 #if 0
 152         "?OX"
 153         "o.O"
 154         "?##" "X",
 155 #endif
 156         /* side pattern - cut (SUSPICIOUS) */
 157         "?OY"
 158         "Y.O"
 159         "###" /* Mogo has "X" */,
 160         /* side pattern - eye piercing:
 161          * # O O O .
 162          * # O . O .
 163          * # . . . .
 164          * # # # # # */
 165         /* side pattern - make eye */
 166         "?X."
 167         "Q.X"
 168         "###",
 169 #if 0
 170         "Oxx"
 171         "..."
 172         "###",
 173 #endif
 174 };
 175 #define moggy_patterns_src_n sizeof(moggy_patterns_src) / sizeof(moggy_patterns_src[0])
 176
 177 static inline bool
 178 test_pattern3_here(struct playout_policy *p, struct board *b, struct move *m, bool middle_ladder)
 179 {
 180         struct moggy_policy *pp = p->data;
 181         /* Check if 3x3 pattern is matched by given move... */
 182         if (!pattern3_move_here(&pp->patterns, b, m))
 183                 return false;
 184         /* ...and the move is not obviously stupid. */
 185         if (is_bad_selfatari(b, m->color, m->coord))
 186                 return false;
 187         /* Ladder moves are stupid. */
 188         group_t atari_neighbor = board_get_atari_neighbor(b, m->coord, m->color);
 189         if (atari_neighbor && is_ladder(b, m->coord, atari_neighbor, middle_ladder)
 190             && !can_countercapture(b, board_at(b, group_base(atari_neighbor)),
 191                                    atari_neighbor, m->color, NULL, 0))
 192                 return false;
 193         return true;
 194 }
 195
 196 static void
 197 apply_pattern_here(struct playout_policy *p, struct board *b, coord_t c, enum stone color, struct move_queue *q)
 198 {
 199         struct moggy_policy *pp = p->data;
 200         struct move m2 = { .coord = c, .color = color };
 201         if (board_is_valid_move(b, &m2) && test_pattern3_here(p, b, &m2, pp->middle_ladder))
 202                 mq_add(q, c, 1<<MQ_PAT3);
 203 }
 204
 205 /* Check if we match any pattern around given move (with the other color to play). */
 206 static void
 207 apply_pattern(struct playout_policy *p, struct board *b, struct move *m, struct move *mm, struct move_queue *q)
 208 {
 209         /* Suicides do not make any patterns and confuse us. */
 210         if (board_at(b, m->coord) == S_NONE || board_at(b, m->coord) == S_OFFBOARD)
 211                 return;
 212
 213         foreach_8neighbor(b, m->coord) {
 214                 apply_pattern_here(p, b, c, stone_other(m->color), q);
 215         } foreach_8neighbor_end;
 216
 217         if (mm) { /* Second move for pattern searching */
 218                 foreach_8neighbor(b, mm->coord) {
 219                         if (coord_is_8adjecent(m->coord, c, b))
 220                                 continue;
 221                         apply_pattern_here(p, b, c, stone_other(m->color), q);
 222                 } foreach_8neighbor_end;
 223         }
 224
 225         if (PLDEBUGL(5))
 226                 mq_print(q, b, "Pattern");
 227 }
 228
 229
 230 static void
 231 joseki_check(struct playout_policy *p, struct board *b, enum stone to_play, struct move_queue *q)
 232 {
 233         struct moggy_policy *pp = p->data;
 234         if (!pp->jdict)
 235                 return;
 236
 237         for (int i = 0; i < 4; i++) {
 238                 hash_t h = b->qhash[i] & joseki_hash_mask;
 239                 coord_t *cc = pp->jdict->patterns[h].moves[to_play];
 240                 if (!cc) continue;
 241                 for (; !is_pass(*cc); cc++) {
 242                         if (coord_quadrant(*cc, b) != i)
 243                                 continue;
 244                         mq_add(q, *cc, 1<<MQ_JOSEKI);
 245                 }
 246         }
 247
 248         if (q->moves > 0 && PLDEBUGL(5))
 249                 mq_print(q, b, "Joseki");
 250 }
 251
 252 static void
 253 global_atari_check(struct playout_policy *p, struct board *b, enum stone to_play, struct move_queue *q)
 254 {
 255         if (b->clen == 0)
 256                 return;
 257
 258         struct moggy_policy *pp = p->data;
 259         if (pp->capcheckall) {
 260                 for (int g = 0; g < b->clen; g++)
 261                         group_atari_check(pp->alwaysccaprate, b, group_at(b, group_base(b->c[g])), to_play, q, NULL, pp->middle_ladder, 1<<MQ_GATARI);
 262                 if (PLDEBUGL(5))
 263                         mq_print(q, b, "Global atari");
 264                 return;
 265         }
 266
 267         int g_base = fast_random(b->clen);
 268         for (int g = g_base; g < b->clen; g++) {
 269                 group_atari_check(pp->alwaysccaprate, b, group_at(b, group_base(b->c[g])), to_play, q, NULL, pp->middle_ladder, 1<<MQ_GATARI);
 270                 if (q->moves > 0) {
 271                         /* XXX: Try carrying on. */
 272                         if (PLDEBUGL(5))
 273                                 mq_print(q, b, "Global atari");
 274                         return;
 275                 }
 276         }
 277         for (int g = 0; g < g_base; g++) {
 278                 group_atari_check(pp->alwaysccaprate, b, group_at(b, group_base(b->c[g])), to_play, q, NULL, pp->middle_ladder, 1<<MQ_GATARI);
 279                 if (q->moves > 0) {
 280                         /* XXX: Try carrying on. */
 281                         if (PLDEBUGL(5))
 282                                 mq_print(q, b, "Global atari");
 283                         return;
 284                 }
 285         }
 286         return;
 287 }
 288
 289 static void
 290 local_atari_check(struct playout_policy *p, struct board *b, struct move *m, struct move_queue *q)
 291 {
 292         struct moggy_policy *pp = p->data;
 293
 294         /* Did the opponent play a self-atari? */
 295         if (board_group_info(b, group_at(b, m->coord)).libs == 1) {
 296                 group_atari_check(pp->alwaysccaprate, b, group_at(b, m->coord), stone_other(m->color), q, NULL, pp->middle_ladder, 1<<MQ_LATARI);
 297         }
 298
 299         foreach_neighbor(b, m->coord, {
 300                 group_t g = group_at(b, c);
 301                 if (!g || board_group_info(b, g).libs != 1)
 302                         continue;
 303                 group_atari_check(pp->alwaysccaprate, b, g, stone_other(m->color), q, NULL, pp->middle_ladder, 1<<MQ_LATARI);
 304         });
 305
 306         if (PLDEBUGL(5))
 307                 mq_print(q, b, "Local atari");
 308 }
 309
 310
 311 static void
 312 local_ladder_check(struct playout_policy *p, struct board *b, struct move *m, struct move_queue *q)
 313 {
 314         group_t group = group_at(b, m->coord);
 315
 316         if (board_group_info(b, group).libs != 2)
 317                 return;
 318
 319         for (int i = 0; i < 2; i++) {
 320                 coord_t chase = board_group_info(b, group).lib[i];
 321                 coord_t escape = board_group_info(b, group).lib[1 - i];
 322                 if (wouldbe_ladder(b, group, escape, chase, board_at(b, group)))
 323                         mq_add(q, chase, 1<<MQ_LADDER);
 324         }
 325
 326         if (q->moves > 0 && PLDEBUGL(5))
 327                 mq_print(q, b, "Ladder");
 328 }
 329
 330
 331 static void
 332 local_2lib_check(struct playout_policy *p, struct board *b, struct move *m, struct libmap_mq *q)
 333 {
 334         struct moggy_policy *pp = p->data;
 335         group_t group = group_at(b, m->coord), group2 = 0;
 336
 337         /* Does the opponent have just two liberties? */
 338         if (board_group_info(b, group).libs == 2) {
 339                 group_2lib_check(b, group, stone_other(m->color), q, 1<<MQ_L2LIB, pp->atari_miaisafe, pp->atari_def_no_hopeless);
 340 #if 0
 341                 /* We always prefer to take off an enemy chain liberty
 342                  * before pulling out ourselves. */
 343                 /* XXX: We aren't guaranteed to return to that group
 344                  * later. */
 345                 if (q->moves)
 346                         return q->move[fast_random(q->moves)];
 347 #endif
 348         }
 349
 350         /* Then he took a third liberty from neighboring chain? */
 351         foreach_neighbor(b, m->coord, {
 352                 group_t g = group_at(b, c);
 353                 if (!g || g == group || g == group2 || board_group_info(b, g).libs != 2)
 354                         continue;
 355                 group_2lib_check(b, g, stone_other(m->color), q, 1<<MQ_L2LIB, pp->atari_miaisafe, pp->atari_def_no_hopeless);
 356                 group2 = g; // prevent trivial repeated checks
 357         });
 358
 359         if (PLDEBUGL(5))
 360                 libmap_mq_print(q, b, "Local 2lib");
 361 }
 362
 363 static void
 364 local_nlib_check(struct playout_policy *p, struct board *b, struct move *m, struct libmap_mq *q)
 365 {
 366         struct moggy_policy *pp = p->data;
 367         enum stone color = stone_other(m->color);
 368
 369         /* Attacking N-liberty groups in general is probably
 370          * not feasible. What we are primarily concerned about is
 371          * counter-attacking groups that have two physical liberties,
 372          * but three effective liberties:
 373          *
 374          * . O . . . . #
 375          * O O X X X X #
 376          * . X O O X . #
 377          * . X O . O X #
 378          * . X O O . X #
 379          * # # # # # # #
 380          *
 381          * The time for this to come is when the opponent took a liberty
 382          * of ours, making a few-liberty group. Therefore, we focus
 383          * purely on defense.
 384          *
 385          * There is a tradeoff - down to how many liberties we need to
 386          * be to start looking? nlib_count=3 will work for the left black
 387          * group (2lib-solver will suggest connecting the false eye), but
 388          * not for top black group (it is too late to start playing 3-3
 389          * capturing race). Also, we cannot prevent stupidly taking an
 390          * outside liberty ourselves; the higher nlib_count, the higher
 391          * the chance we withstand this.
 392          *
 393          * However, higher nlib_count means that we will waste more time
 394          * checking non-urgent or alive groups, and we will play silly
 395          * or wasted moves around alive groups. */
 396
 397         group_t group2 = 0;
 398         foreach_8neighbor(b, m->coord) {
 399                 group_t g = group_at(b, c);
 400                 if (!g || group2 == g || board_at(b, c) != color)
 401                         continue;
 402                 if (board_group_info(b, g).libs < 3 || board_group_info(b, g).libs > pp->nlib_count)
 403                         continue;
 404                 group_nlib_defense_check(b, g, color, q, 1<<MQ_LNLIB);
 405                 group2 = g; // prevent trivial repeated checks
 406         } foreach_8neighbor_end;
 407
 408         if (PLDEBUGL(5))
 409                 libmap_mq_print(q, b, "Local nlib");
 410 }
 411
 412 static coord_t
 413 nakade_check(struct playout_policy *p, struct board *b, struct move *m, enum stone to_play)
 414 {
 415         coord_t empty = pass;
 416         foreach_neighbor(b, m->coord, {
 417                 if (board_at(b, c) != S_NONE)
 418                         continue;
 419                 if (is_pass(empty)) {
 420                         empty = c;
 421                         continue;
 422                 }
 423                 if (!coord_is_8adjecent(c, empty, b)) {
 424                         /* Seems like impossible nakade
 425                          * shape! */
 426                         return pass;
 427                 }
 428         });
 429         assert(!is_pass(empty));
 430
 431         coord_t nakade = nakade_point(b, empty, stone_other(to_play));
 432         if (PLDEBUGL(5) && !is_pass(nakade))
 433                 fprintf(stderr, "Nakade: %s\n", coord2sstr(nakade, b));
 434         return nakade;
 435 }
 436
 437 coord_t
 438 fillboard_check(struct playout_policy *p, struct board *b)
 439 {
 440         struct moggy_policy *pp = p->data;
 441         unsigned int fbtries = b->flen / 8;
 442         if (pp->fillboardtries < fbtries)
 443                 fbtries = pp->fillboardtries;
 444
 445         for (unsigned int i = 0; i < fbtries; i++) {
 446                 coord_t coord = b->f[fast_random(b->flen)];
 447                 if (immediate_liberty_count(b, coord) != 4)
 448                         continue;
 449                 foreach_diag_neighbor(b, coord) {
 450                         if (board_at(b, c) != S_NONE)
 451                                 goto next_try;
 452                 } foreach_diag_neighbor_end;
 453                 return coord;
 454 next_try:
 455                 ;
 456         }
 457         return pass;
 458 }
 459
 460 coord_t
 461 playout_moggy_seqchoose(struct playout_policy *p, struct playout_setup *s, struct board *b, enum stone to_play)
 462 {
 463         struct moggy_policy *pp = p->data;
 464
 465         if (PLDEBUGL(5))
 466                 board_print(b, stderr);
 467
 468         /* Ko fight check */
 469         if (!is_pass(b->last_ko.coord) && is_pass(b->ko.coord)
 470             && b->moves - b->last_ko_age < pp->koage
 471             && pp->korate > fast_random(100)) {
 472                 if (board_is_valid_play(b, to_play, b->last_ko.coord)
 473                     && !is_bad_selfatari(b, to_play, b->last_ko.coord))
 474                         return b->last_ko.coord;
 475         }
 476
 477         /* Local checks */
 478         if (!is_pass(b->last_move.coord)) {
 479                 /* Nakade check */
 480                 if (pp->nakaderate > fast_random(100)
 481                     && immediate_liberty_count(b, b->last_move.coord) > 0) {
 482                         coord_t nakade = nakade_check(p, b, &b->last_move, to_play);
 483                         if (!is_pass(nakade))
 484                                 return nakade;
 485                 }
 486
 487                 /* Local group in atari? */
 488                 if (pp->lcapturerate > fast_random(100)) {
 489                         struct move_queue q; q.moves = 0;
 490                         local_atari_check(p, b, &b->last_move, &q);
 491                         if (q.moves > 0)
 492                                 return mq_pick(&q);
 493                 }
 494
 495                 /* Local group trying to escape ladder? */
 496                 if (pp->ladderrate > fast_random(100)) {
 497                         struct move_queue q; q.moves = 0;
 498                         local_ladder_check(p, b, &b->last_move, &q);
 499                         if (q.moves > 0)
 500                                 return mq_pick(&q);
 501                 }
 502
 503                 /* Local group can be PUT in atari? */
 504                 if (pp->atarirate > fast_random(100)) {
 505                         struct libmap_mq q;  q.mq.moves = 0;
 506                         local_2lib_check(p, b, &b->last_move, &q);
 507                         coord_t c = libmap_queue_mqpick(b->libmap, &q);
 508                         if (!is_pass(c))
 509                                 return c;
 510                 }
 511
 512                 /* Local group reduced some of our groups to 3 libs? */
 513                 if (pp->nlibrate > fast_random(100)) {
 514                         struct libmap_mq q;  q.mq.moves = 0;
 515                         local_nlib_check(p, b, &b->last_move, &q);
 516                         coord_t c = libmap_queue_mqpick(b->libmap, &q);
 517                         if (!is_pass(c))
 518                                 return c;
 519                 }
 520
 521                 /* Check for patterns we know */
 522                 if (pp->patternrate > fast_random(100)) {
 523                         struct move_queue q; q.moves = 0;
 524                         apply_pattern(p, b, &b->last_move,
 525                                           pp->pattern2 && b->last_move2.coord >= 0 ? &b->last_move2 : NULL,
 526                                           &q);
 527                         if (q.moves > 0)
 528                                 return mq_pick(&q);
 529                 }
 530         }
 531
 532         /* Global checks */
 533
 534         /* Any groups in atari? */
 535         if (pp->capturerate > fast_random(100)) {
 536                 struct move_queue q; q.moves = 0;
 537                 global_atari_check(p, b, to_play, &q);
 538                 if (q.moves > 0)
 539                         return mq_pick(&q);
 540         }
 541
 542         /* Joseki moves? */
 543         if (pp->josekirate > fast_random(100)) {
 544                 struct move_queue q; q.moves = 0;
 545                 joseki_check(p, b, to_play, &q);
 546                 if (q.moves > 0)
 547                         return mq_pick(&q);
 548         }
 549
 550         /* Fill board */
 551         if (pp->fillboardtries > 0) {
 552                 coord_t c = fillboard_check(p, b);
 553                 if (!is_pass(c))
 554                         return c;
 555         }
 556
 557         return pass;
 558 }
 559
 560 /* Pick a move from queue q, giving different likelihoods to moves
 561  * based on their tags. */
 562 coord_t
 563 mq_tagged_choose(struct playout_policy *p, struct board *b, enum stone to_play, struct move_queue *q)
 564 {
 565         struct moggy_policy *pp = p->data;
 566
 567         /* First, merge all entries for a move. */
 568         /* We use a naive O(N^2) since the average length of the queue
 569          * is about 1.4. */
 570         for (unsigned int i = 0; i < q->moves; i++) {
 571                 for (unsigned int j = i + 1; j < q->moves; j++) {
 572                         if (q->move[i] != q->move[j])
 573                                 continue;
 574                         q->tag[i] |= q->tag[j];
 575                         q->moves--;
 576                         q->tag[j] = q->tag[q->moves];
 577                         q->move[j] = q->move[q->moves];
 578                 }
 579         }
 580
 581         /* Now, construct a probdist. */
 582         fixp_t total = 0;
 583         fixp_t pd[q->moves];
 584         for (unsigned int i = 0; i < q->moves; i++) {
 585                 double val = 1.0;
 586                 assert(q->tag[i] != 0);
 587                 for (int j = 0; j < MQ_MAX; j++)
 588                         if (q->tag[i] & (1<<j)) {
 589                                 //fprintf(stderr, "%s(%x) %d %f *= %f\n", coord2sstr(q->move[i], b), q->tag[i], j, val, pp->mq_prob[j]);
 590                                 val *= pp->mq_prob[j];
 591                         }
 592                 pd[i] = double_to_fixp(val);
 593                 total += pd[i];
 594         }
 595         total += double_to_fixp(pp->tenuki_prob);
 596
 597         /* Finally, pick a move! */
 598         fixp_t stab = fast_irandom(total);
 599         for (unsigned int i = 0; i < q->moves; i++) {
 600                 //fprintf(stderr, "%s(%x) %f (%f/%f)\n", coord2sstr(q->move[i], b), q->tag[i], fixp_to_double(stab), fixp_to_double(pd[i]), fixp_to_double(total));
 601                 if (stab < pd[i])
 602                         return q->move[i];
 603                 stab -= pd[i];
 604         }
 605
 606         /* Tenuki. */
 607         assert(stab < double_to_fixp(pp->tenuki_prob));
 608         return pass;
 609 }
 610
 611 coord_t
 612 playout_moggy_fullchoose(struct playout_policy *p, struct playout_setup *s, struct board *b, enum stone to_play)
 613 {
 614         struct moggy_policy *pp = p->data;
 615         struct move_queue q; q.moves = 0;
 616
 617         if (PLDEBUGL(5))
 618                 board_print(b, stderr);
 619
 620         /* Ko fight check */
 621         if (!is_pass(b->last_ko.coord) && is_pass(b->ko.coord)
 622             && b->moves - b->last_ko_age < pp->koage) {
 623                 if (board_is_valid_play(b, to_play, b->last_ko.coord)
 624                     && !is_bad_selfatari(b, to_play, b->last_ko.coord))
 625                         mq_add(&q, b->last_ko.coord, 1<<MQ_KO);
 626         }
 627
 628         /* Local checks */
 629         if (!is_pass(b->last_move.coord)) {
 630                 /* Nakade check */
 631                 if (immediate_liberty_count(b, b->last_move.coord) > 0) {
 632                         coord_t nakade = nakade_check(p, b, &b->last_move, to_play);
 633                         if (!is_pass(nakade))
 634                                 mq_add(&q, nakade, 1<<MQ_NAKADE);
 635                 }
 636
 637                 /* Local group in atari? */
 638                 local_atari_check(p, b, &b->last_move, &q);
 639
 640                 /* Local group trying to escape ladder? */
 641                 local_ladder_check(p, b, &b->last_move, &q);
 642
 643                 struct libmap_mq lmq = { .mq = { .moves = 0 } };
 644
 645                 /* Local group can be PUT in atari? */
 646                 local_2lib_check(p, b, &b->last_move, &lmq);
 647
 648                 /* Local group reduced some of our groups to 3 libs? */
 649                 local_nlib_check(p, b, &b->last_move, &lmq);
 650
 651                 mq_append(&q, &lmq.mq);
 652
 653                 /* Check for patterns we know */
 654                 apply_pattern(p, b, &b->last_move,
 655                                 pp->pattern2 && b->last_move2.coord >= 0 ? &b->last_move2 : NULL,
 656                                 &q);
 657         }
 658
 659         /* Global checks */
 660
 661         /* Any groups in atari? */
 662         global_atari_check(p, b, to_play, &q);
 663
 664         /* Joseki moves? */
 665         joseki_check(p, b, to_play, &q);
 666
 667 #if 0
 668         /* Average length of the queue is 1.4 move. */
 669         printf("MQL %d ", q.moves);
 670         for (unsigned int i = 0; i < q.moves; i++)
 671                 printf("%s ", coord2sstr(q.move[i], b));
 672         printf("\n");
 673 #endif
 674
 675         if (q.moves > 0)
 676                 return mq_tagged_choose(p, b, to_play, &q);
 677
 678         /* Fill board */
 679         if (pp->fillboardtries > 0) {
 680                 coord_t c = fillboard_check(p, b);
 681                 if (!is_pass(c))
 682                         return c;
 683         }
 684
 685         return pass;
 686 }
 687
 688
 689 void
 690 playout_moggy_assess_group(struct playout_policy *p, struct prior_map *map, group_t g, int games)
 691 {
 692         struct moggy_policy *pp = p->data;
 693         struct board *b = map->b;
 694
 695         if (board_group_info(b, g).libs > pp->nlib_count)
 696                 return;
 697
 698         if (PLDEBUGL(5)) {
 699                 fprintf(stderr, "ASSESS of group %s:\n", coord2sstr(g, b));
 700                 board_print(b, stderr);
 701         }
 702
 703         if (board_group_info(b, g).libs > 2) {
 704                 if (!pp->nlibrate)
 705                         return;
 706                 if (board_at(b, g) != map->to_play)
 707                         return; // we do only defense
 708                 /* TODO: Tie libmap info into tree search. */
 709                 struct libmap_mq q; q.mq.moves = 0;
 710                 group_nlib_defense_check(b, g, map->to_play, &q, 0);
 711                 while (q.mq.moves--) {
 712                         coord_t coord = q.mq.move[q.mq.moves];
 713                         if (PLDEBUGL(5))
 714                                 fprintf(stderr, "1.0: nlib %s\n", coord2sstr(coord, b));
 715                         int assess = games / 2;
 716                         add_prior_value(map, coord, 1, assess);
 717                 }
 718                 return;
 719         }
 720
 721         if (board_group_info(b, g).libs == 2) {
 722                 if (pp->ladderrate) {
 723                         /* Make sure to play the correct liberty in case
 724                          * this is a group that can be caught in a ladder. */
 725                         bool ladderable = false;
 726                         for (int i = 0; i < 2; i++) {
 727                                 coord_t chase = board_group_info(b, g).lib[i];
 728                                 coord_t escape = board_group_info(b, g).lib[1 - i];
 729                                 if (wouldbe_ladder(b, g, escape, chase, board_at(b, g))) {
 730                                         add_prior_value(map, chase, 1, games);
 731                                         ladderable = true;
 732                                 }
 733                         }
 734                         if (ladderable)
 735                                 return; // do not suggest the other lib at all
 736                 }
 737
 738                 if (!pp->atarirate)
 739                         return;
 740                 struct libmap_mq q; q.mq.moves = 0;
 741                 group_2lib_check(b, g, map->to_play, &q, 0, pp->atari_miaisafe, pp->atari_def_no_hopeless);
 742                 while (q.mq.moves--) {
 743                         coord_t coord = q.mq.move[q.mq.moves];
 744                         if (PLDEBUGL(5))
 745                                 fprintf(stderr, "1.0: 2lib %s\n", coord2sstr(coord, b));
 746                         int assess = games / 2;
 747                         add_prior_value(map, coord, 1, assess);
 748                 }
 749                 return;
 750         }
 751
 752         /* This group, sir, is in atari! */
 753
 754         struct move_queue q; q.moves = 0;
 755         coord_t ladder = pass;
 756         group_atari_check(pp->alwaysccaprate, b, g, map->to_play, &q, &ladder, true, 0);
 757         while (q.moves--) {
 758                 coord_t coord = q.move[q.moves];
 759
 760                 /* _Never_ play here if this move plays out
 761                  * a caught ladder. */
 762                 if (coord == ladder && !board_playing_ko_threat(b)) {
 763                         /* Note that the opposite is not guarded against;
 764                          * we do not advise against capturing a laddered
 765                          * group (but we don't encourage it either). Such
 766                          * a move can simplify tactical situations if we
 767                          * can afford it. */
 768                         if (map->to_play != board_at(b, g))
 769                                 continue;
 770                         /* FIXME: We give the malus even if this move
 771                          * captures another group. */
 772                         if (PLDEBUGL(5))
 773                                 fprintf(stderr, "0.0: ladder %s\n", coord2sstr(coord, b));
 774                         add_prior_value(map, coord, 0, games);
 775                         continue;
 776                 }
 777
 778                 if (!pp->capturerate && !pp->lcapturerate)
 779                         continue;
 780
 781                 int assess = games * 2;
 782                 if (pp->cap_stone_denom > 0) {
 783                         int stones = group_stone_count(b, g, pp->cap_stone_max) - (pp->cap_stone_min-1);
 784                         assess += (stones > 0 ? stones : 0) * games * 100 / pp->cap_stone_denom;
 785                 }
 786                 if (PLDEBUGL(5))
 787                         fprintf(stderr, "1.0 (%d): atari %s\n", assess, coord2sstr(coord, b));
 788                 add_prior_value(map, coord, 1, assess);
 789         }
 790 }
 791
 792 void
 793 playout_moggy_assess_one(struct playout_policy *p, struct prior_map *map, coord_t coord, int games)
 794 {
 795         struct moggy_policy *pp = p->data;
 796         struct board *b = map->b;
 797
 798         if (PLDEBUGL(5)) {
 799                 fprintf(stderr, "ASSESS of move %s:\n", coord2sstr(coord, b));
 800                 board_print(b, stderr);
 801         }
 802
 803         /* Is this move a self-atari? */
 804         if (pp->selfatarirate) {
 805                 if (!board_playing_ko_threat(b) && is_bad_selfatari(b, map->to_play, coord)) {
 806                         if (PLDEBUGL(5))
 807                                 fprintf(stderr, "0.0: self-atari\n");
 808                         add_prior_value(map, coord, 0, games);
 809                         if (!pp->selfatari_other)
 810                                 return;
 811                         /* If we can play on the other liberty of the
 812                          * endangered group, do! */
 813                         coord = selfatari_cousin(b, map->to_play, coord, NULL);
 814                         if (is_pass(coord))
 815                                 return;
 816                         if (PLDEBUGL(5))
 817                                 fprintf(stderr, "1.0: self-atari redirect %s\n", coord2sstr(coord, b));
 818                         add_prior_value(map, coord, 1.0, games);
 819                         return;
 820                 }
 821         }
 822
 823         /* Pattern check */
 824         if (pp->patternrate) {
 825                 struct move m = { .color = map->to_play, .coord = coord };
 826                 if (test_pattern3_here(p, b, &m, true)) {
 827                         if (PLDEBUGL(5))
 828                                 fprintf(stderr, "1.0: pattern\n");
 829                         add_prior_value(map, coord, 1, games);
 830                 }
 831         }
 832
 833         return;
 834 }
 835
 836 void
 837 playout_moggy_assess(struct playout_policy *p, struct prior_map *map, int games)
 838 {
 839         struct moggy_policy *pp = p->data;
 840
 841         /* First, go through all endangered groups. */
 842         for (group_t g = 1; g < board_size2(map->b); g++)
 843                 if (group_at(map->b, g) == g)
 844                         playout_moggy_assess_group(p, map, g, games);
 845
 846         /* Then, assess individual moves. */
 847         if (!pp->patternrate && !pp->selfatarirate)
 848                 return;
 849         foreach_free_point(map->b) {
 850                 if (map->consider[c])
 851                         playout_moggy_assess_one(p, map, c, games);
 852         } foreach_free_point_end;
 853 }
 854
 855 bool
 856 playout_moggy_permit(struct playout_policy *p, struct board *b, struct move *m)
 857 {
 858         struct moggy_policy *pp = p->data;
 859
 860         /* The idea is simple for now - never allow self-atari moves.
 861          * They suck in general, but this also permits us to actually
 862          * handle seki in the playout stage. */
 863
 864         if (fast_random(100) >= pp->selfatarirate) {
 865                 if (PLDEBUGL(5))
 866                         fprintf(stderr, "skipping sar test\n");
 867                 goto sar_skip;
 868         }
 869         bool selfatari = is_bad_selfatari(b, m->color, m->coord);
 870         if (selfatari) {
 871                 if (PLDEBUGL(5))
 872                         fprintf(stderr, "__ Prohibiting self-atari %s %s\n",
 873                                 stone2str(m->color), coord2sstr(m->coord, b));
 874                 if (pp->selfatari_other) {
 875                         /* Ok, try the other liberty of the atari'd group. */
 876                         coord_t c = selfatari_cousin(b, m->color, m->coord, NULL);
 877                         if (is_pass(c)) return false;
 878                         if (PLDEBUGL(5))
 879                                 fprintf(stderr, "___ Redirecting to other lib %s\n",
 880                                         coord2sstr(c, b));
 881                         m->coord = c;
 882                         return true;
 883                 }
 884                 return false;
 885         }
 886 sar_skip:
 887
 888         /* Check if we don't seem to be filling our eye. This should
 889          * happen only for false eyes, but some of them are in fact
 890          * real eyes with diagonal filled by a dead stone. Prefer
 891          * to counter-capture in that case. */
 892         if (fast_random(100) >= pp->eyefillrate) {
 893                 if (PLDEBUGL(5))
 894                         fprintf(stderr, "skipping eyefill test\n");
 895                 goto eyefill_skip;
 896         }
 897         bool eyefill = board_is_eyelike(b, m->coord, m->color);
 898         if (eyefill) {
 899                 foreach_diag_neighbor(b, m->coord) {
 900                         if (board_at(b, c) != stone_other(m->color))
 901                                 continue;
 902                         switch (board_group_info(b, group_at(b, c)).libs) {
 903                         case 1: /* Capture! */
 904                                 c = board_group_info(b, group_at(b, c)).lib[0];
 905                                 if (PLDEBUGL(5))
 906                                         fprintf(stderr, "___ Redirecting to capture %s\n",
 907                                                 coord2sstr(c, b));
 908                                 m->coord = c;
 909                                 return true;
 910                         case 2: /* Try to switch to some 2-lib neighbor. */
 911                                 for (int i = 0; i < 2; i++) {
 912                                         coord_t l = board_group_info(b, group_at(b, c)).lib[i];
 913                                         if (board_is_one_point_eye(b, l, board_at(b, c)))
 914                                                 continue;
 915                                         if (is_bad_selfatari(b, m->color, l))
 916                                                 continue;
 917                                         m->coord = l;
 918                                         return true;
 919                                 }
 920                                 break;
 921                         }
 922                 } foreach_diag_neighbor_end;
 923         }
 924
 925 eyefill_skip:
 926         return true;
 927 }
 928
 929
 930 struct playout_policy *
 931 playout_moggy_init(char *arg, struct board *b, struct joseki_dict *jdict)
 932 {
 933         struct playout_policy *p = calloc2(1, sizeof(*p));
 934         struct moggy_policy *pp = calloc2(1, sizeof(*pp));
 935         p->data = pp;
 936         p->choose = playout_moggy_seqchoose;
 937         p->assess = playout_moggy_assess;
 938         p->permit = playout_moggy_permit;
 939
 940         pp->jdict = jdict;
 941
 942         /* These settings are tuned for 19x19 play with several threads
 943          * on reasonable time limits (i.e., rather large number of playouts).
 944          * XXX: no 9x9 tuning has been done recently. */
 945         int rate = board_large(b) ? 80 : 90;
 946
 947         pp->lcapturerate = pp->atarirate = pp->nlibrate = pp->patternrate
 948                 = pp->selfatarirate = pp->eyefillrate = pp->josekirate = -1U;
 949         if (board_large(b)) {
 950                 pp->lcapturerate = 90;
 951                 pp->patternrate = 100;
 952                 pp->nlibrate = 20;
 953                 pp->nakaderate = 20;
 954                 pp->pattern2 = true;
 955         }
 956         pp->korate = 20; pp->koage = 4;
 957         pp->alwaysccaprate = 20;
 958         pp->selfatari_other = true;
 959
 960         pp->cap_stone_min = 2;
 961         pp->cap_stone_max = 15;
 962         pp->cap_stone_denom = 200;
 963
 964         pp->atari_def_no_hopeless = !board_large(b);
 965         pp->atari_miaisafe = true;
 966         pp->nlib_count = 4;
 967
 968         /* C is stupid. */
 969         double mq_prob_default[MQ_MAX] = {
 970                 [MQ_KO] = 6.0,
 971                 [MQ_NAKADE] = 5.5,
 972                 [MQ_LATARI] = 5.0,
 973                 [MQ_L2LIB] = 4.0,
 974                 [MQ_LNLIB] = 3.5,
 975                 [MQ_PAT3] = 3.0,
 976                 [MQ_GATARI] = 2.0,
 977                 [MQ_JOSEKI] = 1.0,
 978         };
 979         memcpy(pp->mq_prob, mq_prob_default, sizeof(pp->mq_prob));
 980
 981         if (arg) {
 982                 char *optspec, *next = arg;
 983                 while (*next) {
 984                         optspec = next;
 985                         next += strcspn(next, ":");
 986                         if (*next) { *next++ = 0; } else { *next = 0; }
 987
 988                         char *optname = optspec;
 989                         char *optval = strchr(optspec, '=');
 990                         if (optval) *optval++ = 0;
 991
 992                         if (!strcasecmp(optname, "debug") && optval) {
 993                                 p->debug_level = atoi(optval);
 994                         } else if (!strcasecmp(optname, "lcapturerate") && optval) {
 995                                 pp->lcapturerate = atoi(optval);
 996                         } else if (!strcasecmp(optname, "ladderrate") && optval) {
 997                                 pp->ladderrate = atoi(optval);
 998                         } else if (!strcasecmp(optname, "atarirate") && optval) {
 999                                 pp->atarirate = atoi(optval);
1000                         } else if (!strcasecmp(optname, "nlibrate") && optval) {
1001                                 pp->nlibrate = atoi(optval);
1002                         } else if (!strcasecmp(optname, "capturerate") && optval) {
1003                                 pp->capturerate = atoi(optval);
1004                         } else if (!strcasecmp(optname, "patternrate") && optval) {
1005                                 pp->patternrate = atoi(optval);
1006                         } else if (!strcasecmp(optname, "selfatarirate") && optval) {
1007                                 pp->selfatarirate = atoi(optval);
1008                         } else if (!strcasecmp(optname, "eyefillrate") && optval) {
1009                                 pp->eyefillrate = atoi(optval);
1010                         } else if (!strcasecmp(optname, "korate") && optval) {
1011                                 pp->korate = atoi(optval);
1012                         } else if (!strcasecmp(optname, "josekirate") && optval) {
1013                                 pp->josekirate = atoi(optval);
1014                         } else if (!strcasecmp(optname, "nakaderate") && optval) {
1015                                 pp->nakaderate = atoi(optval);
1016                         } else if (!strcasecmp(optname, "alwaysccaprate") && optval) {
1017                                 pp->alwaysccaprate = atoi(optval);
1018                         } else if (!strcasecmp(optname, "rate") && optval) {
1019                                 rate = atoi(optval);
1020                         } else if (!strcasecmp(optname, "fillboardtries")) {
1021                                 pp->fillboardtries = atoi(optval);
1022                         } else if (!strcasecmp(optname, "koage") && optval) {
1023                                 pp->koage = atoi(optval);
1024                         } else if (!strcasecmp(optname, "pattern2")) {
1025                                 pp->pattern2 = optval && *optval == '0' ? false : true;
1026                         } else if (!strcasecmp(optname, "selfatari_other")) {
1027                                 pp->selfatari_other = optval && *optval == '0' ? false : true;
1028                         } else if (!strcasecmp(optname, "capcheckall")) {
1029                                 pp->capcheckall = optval && *optval == '0' ? false : true;
1030                         } else if (!strcasecmp(optname, "cap_stone_min") && optval) {
1031                                 pp->cap_stone_min = atoi(optval);
1032                         } else if (!strcasecmp(optname, "cap_stone_max") && optval) {
1033                                 pp->cap_stone_max = atoi(optval);
1034                         } else if (!strcasecmp(optname, "cap_stone_denom") && optval) {
1035                                 pp->cap_stone_denom = atoi(optval);
1036                         } else if (!strcasecmp(optname, "atari_miaisafe")) {
1037                                 pp->atari_miaisafe = optval && *optval == '0' ? false : true;
1038                         } else if (!strcasecmp(optname, "atari_def_no_hopeless")) {
1039                                 pp->atari_def_no_hopeless = optval && *optval == '0' ? false : true;
1040                         } else if (!strcasecmp(optname, "nlib_count") && optval) {
1041                                 pp->nlib_count = atoi(optval);
1042                         } else if (!strcasecmp(optname, "middle_ladder")) {
1043                                 pp->middle_ladder = optval && *optval == '0' ? false : true;
1044                         } else if (!strcasecmp(optname, "fullchoose")) {
1045                                 p->choose = optval && *optval == '0' ? playout_moggy_seqchoose : playout_moggy_fullchoose;
1046                         } else if (!strcasecmp(optname, "mqprob") && optval) {
1047                                 /* KO%LATARI%L2LIB%LNLIB%PAT3%GATARI%JOSEKI%NAKADE */
1048                                 for (int i = 0; *optval && i < MQ_MAX; i++) {
1049                                         pp->mq_prob[i] = atof(optval);
1050                                         optval += strcspn(optval, "%");
1051                                         if (*optval) optval++;
1052                                 }
1053                         } else if (!strcasecmp(optname, "tenukiprob") && optval) {
1054                                 pp->tenuki_prob = atof(optval);
1055                         } else {
1056                                 fprintf(stderr, "playout-moggy: Invalid policy argument %s or missing value\n", optname);
1057                                 exit(1);
1058                         }
1059                 }
1060         }
1061         if (pp->lcapturerate == -1U) pp->lcapturerate = rate;
1062         if (pp->atarirate == -1U) pp->atarirate = rate;
1063         if (pp->nlibrate == -1U) pp->nlibrate = rate;
1064         if (pp->capturerate == -1U) pp->capturerate = rate;
1065         if (pp->patternrate == -1U) pp->patternrate = rate;
1066         if (pp->selfatarirate == -1U) pp->selfatarirate = rate;
1067         if (pp->eyefillrate == -1U) pp->eyefillrate = rate;
1068         if (pp->korate == -1U) pp->korate = rate;
1069         if (pp->josekirate == -1U) pp->josekirate = rate;
1070         if (pp->ladderrate == -1U) pp->ladderrate = rate;
1071         if (pp->nakaderate == -1U) pp->nakaderate = rate;
1072         if (pp->alwaysccaprate == -1U) pp->alwaysccaprate = rate;
1073
1074         pattern3s_init(&pp->patterns, moggy_patterns_src, moggy_patterns_src_n);
1075
1076         return p;
1077 }