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