Merge branch 'master' into libmap

[pachi.git] / playout / moggy.c

/* Heuristical playout (and tree prior) policy modelled primarily after
 * the description of the Mogo engine. */

#include <assert.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>

#define DEBUG
#include "board.h"
#include "debug.h"
#include "joseki/base.h"
#include "mq.h"
#include "pattern3.h"
#include "playout.h"
#include "playout/moggy.h"
#include "random.h"
#include "tactics/1lib.h"
#include "tactics/2lib.h"
#include "tactics/nlib.h"
#include "tactics/ladder.h"
#include "tactics/nakade.h"
#include "tactics/selfatari.h"
#include "tactics/goals.h"
#include "uct/prior.h"

#define PLDEBUGL(n) DEBUGL_(p->debug_level, n)


/* In case "seqchoose" move picker is enabled (i.e. no "fullchoose"
 * parameter passed), we stochastically apply fixed set of decision
 * rules in given order.
 *
 * In "fullchoose" mode, we instead build a move queue of variously
 * tagged candidates, then consider a probability distribution over
 * them and pick a move from that. */

/* Move queue tags. Some may be even undesirable - these moves then
 * receive a penalty; penalty tags should be used only when it is
 * certain the move would be considered anyway. */
enum mq_tag {
        MQ_KO = 0,
        MQ_LATARI,
        MQ_L2LIB,
#define MQ_LADDER MQ_L2LIB /* XXX: We want to fit in char still! */
        MQ_LNLIB,
        MQ_PAT3,
        MQ_GATARI,
        MQ_JOSEKI,
        MQ_NAKADE,
        MQ_MAX
};


#define PAT3_N 15

/* Note that the context can be shared by multiple threads! */

struct moggy_policy {
        unsigned int lcapturerate, atarirate, nlibrate, ladderrate, capturerate, patternrate, korate, josekirate, nakaderate, eyefixrate;
        unsigned int selfatarirate, eyefillrate, alwaysccaprate;
        unsigned int fillboardtries;
        int koage;
        /* Whether to look for patterns around second-to-last move. */
        bool pattern2;
        /* Whether, when self-atari attempt is detected, to play the other
         * group's liberty if that is non-self-atari. */
        bool selfatari_other;
        /* Whether to read out ladders elsewhere than near the board
         * in the playouts. Note that such ladder testing is currently
         * a fairly expensive operation. */
        bool middle_ladder;

        /* 1lib settings: */
        /* Whether to always pick from moves capturing all groups in
         * global_atari_check(). */
        bool capcheckall;
        /* Prior stone weighting. Weight of each stone between
         * cap_stone_min and cap_stone_max is (assess*100)/cap_stone_denom. */
        int cap_stone_min, cap_stone_max;
        int cap_stone_denom;

        /* 2lib settings: */
        bool atari_def_no_hopeless;
        bool atari_miaisafe;

        /* nlib settings: */
        int nlib_count;

        struct joseki_dict *jdict;
        struct pattern3s patterns;

        double pat3_gammas[PAT3_N];

        /* Gamma values for queue tags - correspond to probabilities. */
        /* XXX: Tune. */
        bool fullchoose;
        double mq_prob[MQ_MAX], tenuki_prob;
};


static char moggy_patterns_src[PAT3_N][11] = {
        /* hane pattern - enclosing hane */     /* 0.52 */
        "XOX"
        "..."
        "???",
        /* hane pattern - non-cutting hane */   /* 0.53 */
        "YO."
        "..."
        "?.?",
        /* hane pattern - magari */             /* 0.32 */
        "XO?"
        "X.."
        "x.?",
        /* hane pattern - thin hane */          /* 0.22 */
        "XOO"
        "..."
        "?.?" "X",
        /* generic pattern - katatsuke or diagonal attachment; similar to magari */     /* 0.37 */
        ".Q."
        "Y.."
        "...",
        /* cut1 pattern (kiri) - unprotected cut */     /* 0.28 */
        "XO?"
        "O.o"
        "?o?",
        /* cut1 pattern (kiri) - peeped cut */  /* 0.21 */
        "XO?"
        "O.X"
        "???",
        /* cut2 pattern (de) */                 /* 0.19 */
        "?X?"
        "O.O"
        "ooo",
        /* cut keima (not in Mogo) */           /* 0.82 */
        "OX?"
        "?.O"
        "?o?", /* oo? has some pathological tsumego cases */
        /* side pattern - chase */              /* 0.12 */
        "X.?"
        "O.?"
        "##?",
        /* side pattern - block side cut */     /* 0.20 */
        "OX?"
        "X.O"
        "###",
        /* side pattern - block side connection */      /* 0.11 */
        "?X?"
        "x.O"
        "###",
        /* side pattern - sagari (SUSPICIOUS) */        /* 0.16 */
        "?XQ"
        "x.x" /* Mogo has "x.?" */
        "###" /* Mogo has "X" */,
#if 0
        /* side pattern - throw-in (SUSPICIOUS) */
        "?OX"
        "o.O"
        "?##" "X",
#endif
        /* side pattern - cut (SUSPICIOUS) */   /* 0.57 */
        "?OY"
        "Y.O"
        "###" /* Mogo has "X" */,
        /* side pattern - eye piercing:
         * # O O O .
         * # O . O .
         * # . . . .
         * # # # # # */
        /* side pattern - make eye */           /* 0.44 */
        "?X."
        "Q.X"
        "###",
#if 0
        "Oxx"
        "..."
        "###",
#endif
};
#define moggy_patterns_src_n sizeof(moggy_patterns_src) / sizeof(moggy_patterns_src[0])

static inline bool
test_pattern3_here(struct playout_policy *p, struct board *b, struct move *m, bool middle_ladder, double *gamma)
{
        struct moggy_policy *pp = p->data;
        /* Check if 3x3 pattern is matched by given move... */
        char pi = -1;
        if (!pattern3_move_here(&pp->patterns, b, m, &pi))
                return false;
        /* ...and the move is not obviously stupid. */
        if (is_bad_selfatari(b, m->color, m->coord))
                return false;
        /* Ladder moves are stupid. */
        group_t atari_neighbor = board_get_atari_neighbor(b, m->coord, m->color);
        if (atari_neighbor && is_ladder(b, m->coord, atari_neighbor, middle_ladder)
            && !can_countercapture(b, board_at(b, group_base(atari_neighbor)),
                                   atari_neighbor, m->color, NULL, 0))
                return false;
        //fprintf(stderr, "%s: %d (%.3f)\n", coord2sstr(m->coord, b), (int) pi, pp->pat3_gammas[(int) pi]);
        if (gamma)
                *gamma = pp->pat3_gammas[(int) pi];
        return true;
}

static void
apply_pattern_here(struct playout_policy *p, struct board *b, coord_t c, enum stone color, struct move_queue *q, fixp_t *gammas)
{
        struct moggy_policy *pp = p->data;
        struct move m2 = { .coord = c, .color = color };
        double gamma;
        if (board_is_valid_move(b, &m2) && test_pattern3_here(p, b, &m2, pp->middle_ladder, &gamma)) {
                mq_gamma_add(q, gammas, c, gamma, 1<<MQ_PAT3);
        }
}

/* Check if we match any pattern around given move (with the other color to play). */
static void
apply_pattern(struct playout_policy *p, struct board *b, struct move *m, struct move *mm, struct move_queue *q, fixp_t *gammas)
{
        /* Suicides do not make any patterns and confuse us. */
        if (board_at(b, m->coord) == S_NONE || board_at(b, m->coord) == S_OFFBOARD)
                return;

        foreach_8neighbor(b, m->coord) {
                apply_pattern_here(p, b, c, stone_other(m->color), q, gammas);
        } foreach_8neighbor_end;

        if (mm) { /* Second move for pattern searching */
                foreach_8neighbor(b, mm->coord) {
                        if (coord_is_8adjecent(m->coord, c, b))
                                continue;
                        apply_pattern_here(p, b, c, stone_other(m->color), q, gammas);
                } foreach_8neighbor_end;
        }

        if (PLDEBUGL(5))
                mq_gamma_print(q, gammas, b, "Pattern");
}


static void
joseki_check(struct playout_policy *p, struct board *b, enum stone to_play, struct move_queue *q)
{
        struct moggy_policy *pp = p->data;
        if (!pp->jdict)
                return;

        for (int i = 0; i < 4; i++) {
                hash_t h = b->qhash[i] & joseki_hash_mask;
                coord_t *cc = pp->jdict->patterns[h].moves[to_play];
                if (!cc) continue;
                for (; !is_pass(*cc); cc++) {
                        if (coord_quadrant(*cc, b) != i)
                                continue;
                        if (board_is_valid_play(b, to_play, *cc))
                                continue;
                        mq_add(q, *cc, 1<<MQ_JOSEKI);
                }
        }

        if (q->moves > 0 && PLDEBUGL(5))
                mq_print(q, b, "Joseki");
}

static void
global_atari_check(struct playout_policy *p, struct board *b, enum stone to_play, struct move_queue *q)
{
        if (b->clen == 0)
                return;

        struct moggy_policy *pp = p->data;
        if (pp->capcheckall) {
                for (int g = 0; g < b->clen; g++)
                        group_atari_check(pp->alwaysccaprate, b, group_at(b, group_base(b->c[g])), to_play, q, NULL, pp->middle_ladder, 1<<MQ_GATARI);
                if (PLDEBUGL(5))
                        mq_print(q, b, "Global atari");
                if (pp->fullchoose)
                        return;
        }

        int g_base = fast_random(b->clen);
        for (int g = g_base; g < b->clen; g++) {
                group_atari_check(pp->alwaysccaprate, b, group_at(b, group_base(b->c[g])), to_play, q, NULL, pp->middle_ladder, 1<<MQ_GATARI);
                if (q->moves > 0) {
                        /* XXX: Try carrying on. */
                        if (PLDEBUGL(5))
                                mq_print(q, b, "Global atari");
                        if (pp->fullchoose)
                                return;
                }
        }
        for (int g = 0; g < g_base; g++) {
                group_atari_check(pp->alwaysccaprate, b, group_at(b, group_base(b->c[g])), to_play, q, NULL, pp->middle_ladder, 1<<MQ_GATARI);
                if (q->moves > 0) {
                        /* XXX: Try carrying on. */
                        if (PLDEBUGL(5))
                                mq_print(q, b, "Global atari");
                        if (pp->fullchoose)
                                return;
                }
        }
}

static void
local_atari_check(struct playout_policy *p, struct board *b, struct move *m, struct move_queue *q)
{
        struct moggy_policy *pp = p->data;

        /* Did the opponent play a self-atari? */
        if (board_group_info(b, group_at(b, m->coord)).libs == 1) {
                group_atari_check(pp->alwaysccaprate, b, group_at(b, m->coord), stone_other(m->color), q, NULL, pp->middle_ladder, 1<<MQ_LATARI);
        }

        foreach_neighbor(b, m->coord, {
                group_t g = group_at(b, c);
                if (!g || board_group_info(b, g).libs != 1)
                        continue;
                group_atari_check(pp->alwaysccaprate, b, g, stone_other(m->color), q, NULL, pp->middle_ladder, 1<<MQ_LATARI);
        });

        if (PLDEBUGL(5))
                mq_print(q, b, "Local atari");
}


static void
local_ladder_check(struct playout_policy *p, struct board *b, struct move *m, struct move_queue *q)
{
        group_t group = group_at(b, m->coord);

        if (board_group_info(b, group).libs != 2)
                return;

        for (int i = 0; i < 2; i++) {
                coord_t chase = board_group_info(b, group).lib[i];
                coord_t escape = board_group_info(b, group).lib[1 - i];
                if (wouldbe_ladder(b, group, escape, chase, board_at(b, group)))
                        mq_add(q, chase, 1<<MQ_LADDER);
        }

        if (q->moves > 0 && PLDEBUGL(5))
                mq_print(q, b, "Ladder");
}


static void
local_2lib_check(struct playout_policy *p, struct board *b, struct move *m, struct libmap_mq *q)
{
        struct moggy_policy *pp = p->data;
        group_t group = group_at(b, m->coord), group2 = 0;

        /* Does the opponent have just two liberties? */
        if (board_group_info(b, group).libs == 2) {
                group_2lib_check(b, group, stone_other(m->color), q, 1<<MQ_L2LIB, pp->atari_miaisafe, pp->atari_def_no_hopeless);
#if 0
                /* We always prefer to take off an enemy chain liberty
                 * before pulling out ourselves. */
                /* XXX: We aren't guaranteed to return to that group
                 * later. */
                if (q->moves)
                        return q->move[fast_random(q->moves)];
#endif
        }

        /* Then he took a third liberty from neighboring chain? */
        foreach_neighbor(b, m->coord, {
                group_t g = group_at(b, c);
                if (!g || g == group || g == group2 || board_group_info(b, g).libs != 2)
                        continue;
                group_2lib_check(b, g, stone_other(m->color), q, 1<<MQ_L2LIB, pp->atari_miaisafe, pp->atari_def_no_hopeless);
                group2 = g; // prevent trivial repeated checks
        });

        if (PLDEBUGL(5))
                libmap_mq_print(q, b, "Local 2lib");
}

static void
local_nlib_check(struct playout_policy *p, struct board *b, struct move *m, struct libmap_mq *q)
{
        struct moggy_policy *pp = p->data;
        enum stone color = stone_other(m->color);

        /* Attacking N-liberty groups in general is probably
         * not feasible. What we are primarily concerned about is
         * counter-attacking groups that have two physical liberties,
         * but three effective liberties:
         *
         * . O . . . . #
         * O O X X X X #
         * . X O O X . #
         * . X O . O X #
         * . X O O . X #
         * # # # # # # #
         *
         * The time for this to come is when the opponent took a liberty
         * of ours, making a few-liberty group. Therefore, we focus
         * purely on defense.
         *
         * There is a tradeoff - down to how many liberties we need to
         * be to start looking? nlib_count=3 will work for the left black
         * group (2lib-solver will suggest connecting the false eye), but
         * not for top black group (it is too late to start playing 3-3
         * capturing race). Also, we cannot prevent stupidly taking an
         * outside liberty ourselves; the higher nlib_count, the higher
         * the chance we withstand this.
         *
         * However, higher nlib_count means that we will waste more time
         * checking non-urgent or alive groups, and we will play silly
         * or wasted moves around alive groups. */

        group_t group2 = 0;
        foreach_8neighbor(b, m->coord) {
                group_t g = group_at(b, c);
                if (!g || group2 == g || board_at(b, c) != color)
                        continue;
                if (board_group_info(b, g).libs < 3 || board_group_info(b, g).libs > pp->nlib_count)
                        continue;
                group_nlib_defense_check(b, g, color, q, 1<<MQ_LNLIB);
                group2 = g; // prevent trivial repeated checks
        } foreach_8neighbor_end;

        if (PLDEBUGL(5))
                libmap_mq_print(q, b, "Local nlib");
}

static coord_t
nakade_check(struct playout_policy *p, struct board *b, struct move *m, enum stone to_play)
{
        coord_t empty = pass;
        foreach_neighbor(b, m->coord, {
                if (board_at(b, c) != S_NONE)
                        continue;
                if (is_pass(empty)) {
                        empty = c;
                        continue;
                }
                if (!coord_is_8adjecent(c, empty, b)) {
                        /* Seems like impossible nakade
                         * shape! */
                        return pass;
                }
        });
        assert(!is_pass(empty));

        coord_t nakade = nakade_point(b, empty, stone_other(to_play));
        if (PLDEBUGL(5) && !is_pass(nakade))
                fprintf(stderr, "Nakade: %s\n", coord2sstr(nakade, b));
        return nakade;
}

static void
eye_fix_check(struct playout_policy *p, struct board *b, struct move *m, enum stone to_play, struct move_queue *q)
{
        /* The opponent could have filled an approach liberty for
         * falsifying an eye like these:
         *
         * # # # # # #    X . X X O O  last_move == 1
         * X X 2 O 1 O    X X 2 O 1 O  => suggest 2
         * X . X X O .    X . X X O .
         * X X O O . .    X X O O . O
         *
         * This case seems pretty common (e.g. Zen-Ishida game). */

        /* Iterator for walking coordinates in a clockwise fashion
         * (nei8 jumps "over" the middle point, inst. of "around). */
        int size = board_size(b);
        int nei8_clockwise[10] = { -size-1, 1, 1, size, size, -1, -1, -size, -size, 1 };

        /* This is sort of like a cross between foreach_diag_neighbor
         * and foreach_8neighbor. */
        coord_t c = m->coord;
        for (int dni = 0; dni < 8; dni += 2) {
                // one diagonal neighbor
                coord_t c0 = c + nei8_clockwise[dni];
                // adjecent staight neighbor
                coord_t c1 = c0 + nei8_clockwise[dni + 1];
                // and adjecent another diagonal neighbor
                coord_t c2 = c1 + nei8_clockwise[dni + 2];

                /* The last move must have a pair of unfriendly diagonal
                 * neighbors separated by a friendly stone. */
                //fprintf(stderr, "inv. %s(%s)-%s(%s)-%s(%s), imm. libcount %d\n", coord2sstr(c0, b), stone2str(board_at(b, c0)), coord2sstr(c1, b), stone2str(board_at(b, c1)), coord2sstr(c2, b), stone2str(board_at(b, c2)), immediate_liberty_count(b, c1));
                if ((board_at(b, c0) == to_play || board_at(b, c0) == S_OFFBOARD)
                    && board_at(b, c1) == m->color
                    && (board_at(b, c2) == to_play || board_at(b, c2) == S_OFFBOARD)
                    /* The friendly stone then must have an empty neighbor... */
                    /* XXX: This works only for single stone, not e.g. for two
                     * stones in a row */
                    && immediate_liberty_count(b, c1) > 0) {
                        foreach_neighbor(b, c1, {
                                if (c == m->coord || board_at(b, c) != S_NONE)
                                        continue;
                                /* ...and the neighbor must potentially falsify
                                 * an eye. */
                                coord_t falsifying = c;
                                foreach_diag_neighbor(b, falsifying) {
                                        if (board_at(b, c) != S_NONE)
                                                continue;
                                        if (!board_is_eyelike(b, c, to_play))
                                                continue;
                                        /* We don't care about eyes that already
                                         * _are_ false (board_is_false_eyelike())
                                         * but that can become false. Therefore,
                                         * either ==1 diagonal neighbor is
                                         * opponent's (except in atari) or ==2
                                         * are board edge. */
                                        coord_t falsified = c;
                                        int color_diag_libs[S_MAX] = {0};
                                        foreach_diag_neighbor(b, falsified) {
                                                if (board_at(b, c) == m->color && board_group_info(b, group_at(b, c)).libs == 1) {
                                                        /* Suggest capturing a falsifying stone in atari. */
                                                        mq_add(q, board_group_info(b, group_at(b, c)).lib[0], 0);
                                                } else {
                                                        color_diag_libs[board_at(b, c)]++;
                                                }
                                        } foreach_diag_neighbor_end;
                                        if (color_diag_libs[m->color] == 1 || (color_diag_libs[m->color] == 0 && color_diag_libs[S_OFFBOARD] == 2)) {
                                                /* That's it. Fill the falsifying
                                                 * liberty before it's too late! */
                                                mq_add(q, falsifying, 0);
                                        }
                                } foreach_diag_neighbor_end;
                        });
                }

                c = c1;
        }

        if (q->moves > 0 && PLDEBUGL(5))
                mq_print(q, b, "Eye fix");
}

coord_t
fillboard_check(struct playout_policy *p, struct board *b)
{
        struct moggy_policy *pp = p->data;
        unsigned int fbtries = b->flen / 8;
        if (pp->fillboardtries < fbtries)
                fbtries = pp->fillboardtries;

        for (unsigned int i = 0; i < fbtries; i++) {
                coord_t coord = b->f[fast_random(b->flen)];
                if (immediate_liberty_count(b, coord) != 4)
                        continue;
                foreach_diag_neighbor(b, coord) {
                        if (board_at(b, c) != S_NONE)
                                goto next_try;
                } foreach_diag_neighbor_end;
                return coord;
next_try:
                ;
        }
        return pass;
}

coord_t
playout_moggy_seqchoose(struct playout_policy *p, struct playout_setup *s, struct board *b, enum stone to_play)
{
        struct moggy_policy *pp = p->data;

        if (PLDEBUGL(5))
                board_print(b, stderr);

        /* Ko fight check */
        if (!is_pass(b->last_ko.coord) && is_pass(b->ko.coord)
            && b->moves - b->last_ko_age < pp->koage
            && pp->korate > fast_random(100)) {
                if (board_is_valid_play(b, to_play, b->last_ko.coord)
                    && !is_bad_selfatari(b, to_play, b->last_ko.coord))
                        return b->last_ko.coord;
        }

        /* Local checks */
        if (!is_pass(b->last_move.coord)) {
                /* Nakade check */
                if (pp->nakaderate > fast_random(100)
                    && immediate_liberty_count(b, b->last_move.coord) > 0) {
                        coord_t nakade = nakade_check(p, b, &b->last_move, to_play);
                        if (!is_pass(nakade))
                                return nakade;
                }

                /* Local group in atari? */
                if (pp->lcapturerate > fast_random(100)) {
                        struct move_queue q; q.moves = 0;
                        local_atari_check(p, b, &b->last_move, &q);
                        if (q.moves > 0)
                                return mq_pick(&q);
                }

                /* Local group trying to escape ladder? */
                if (pp->ladderrate > fast_random(100)) {
                        struct move_queue q; q.moves = 0;
                        local_ladder_check(p, b, &b->last_move, &q);
                        if (q.moves > 0)
                                return mq_pick(&q);
                }

                /* Local group can be PUT in atari? */
                if (pp->atarirate > fast_random(100)) {
                        struct libmap_mq q;  q.mq.moves = 0;
                        local_2lib_check(p, b, &b->last_move, &q);
                        coord_t c = libmap_queue_mqpick(b, &q);
                        if (!is_pass(c))
                                return c;
                }

                /* Local group reduced some of our groups to 3 libs? */
                if (pp->nlibrate > fast_random(100)) {
                        struct libmap_mq q;  q.mq.moves = 0;
                        local_nlib_check(p, b, &b->last_move, &q);
                        coord_t c = libmap_queue_mqpick(b, &q);
                        if (!is_pass(c))
                                return c;
                }

                /* Some other semeai-ish shape checks */
                if (pp->eyefixrate > fast_random(100)) {
                        struct move_queue q; q.moves = 0;
                        eye_fix_check(p, b, &b->last_move, to_play, &q);
                        if (q.moves > 0)
                                return mq_pick(&q);
                }

                /* Check for patterns we know */
                if (pp->patternrate > fast_random(100)) {
                        struct move_queue q; q.moves = 0;
                        fixp_t gammas[MQL];
                        apply_pattern(p, b, &b->last_move,
                                          pp->pattern2 && b->last_move2.coord >= 0 ? &b->last_move2 : NULL,
                                          &q, gammas);
                        if (q.moves > 0)
                                return mq_gamma_pick(&q, gammas);
                }
        }

        /* Global checks */

        /* Any groups in atari? */
        if (pp->capturerate > fast_random(100)) {
                struct move_queue q; q.moves = 0;
                global_atari_check(p, b, to_play, &q);
                if (q.moves > 0)
                        return mq_pick(&q);
        }

        /* Joseki moves? */
        if (pp->josekirate > fast_random(100)) {
                struct move_queue q; q.moves = 0;
                joseki_check(p, b, to_play, &q);
                if (q.moves > 0)
                        return mq_pick(&q);
        }

        /* Fill board */
        if (pp->fillboardtries > 0) {
                coord_t c = fillboard_check(p, b);
                if (!is_pass(c))
                        return c;
        }

        return pass;
}

/* Pick a move from queue q, giving different likelihoods to moves
 * based on their tags. */
coord_t
mq_tagged_choose(struct playout_policy *p, struct board *b, enum stone to_play, struct move_queue *q)
{
        struct moggy_policy *pp = p->data;

        /* First, merge all entries for a move. */
        /* We use a naive O(N^2) since the average length of the queue
         * is about 1.4. */
        for (unsigned int i = 0; i < q->moves; i++) {
                for (unsigned int j = i + 1; j < q->moves; j++) {
                        if (q->move[i] != q->move[j])
                                continue;
                        q->tag[i] |= q->tag[j];
                        q->moves--;
                        q->tag[j] = q->tag[q->moves];
                        q->move[j] = q->move[q->moves];
                }
        }

        /* Now, construct a probdist. */
        fixp_t total = 0;
        fixp_t pd[q->moves];
        for (unsigned int i = 0; i < q->moves; i++) {
                double val = 1.0;
                assert(q->tag[i] != 0);
                for (int j = 0; j < MQ_MAX; j++)
                        if (q->tag[i] & (1<<j)) {
                                //fprintf(stderr, "%s(%x) %d %f *= %f\n", coord2sstr(q->move[i], b), q->tag[i], j, val, pp->mq_prob[j]);
                                val *= pp->mq_prob[j];
                        }
                pd[i] = double_to_fixp(val);
                total += pd[i];
        }
        total += double_to_fixp(pp->tenuki_prob);

        /* Finally, pick a move! */
        fixp_t stab = fast_irandom(total);
        if (PLDEBUGL(5)) {
                fprintf(stderr, "Pick (total %.3f stab %.3f): ", fixp_to_double(total), fixp_to_double(stab));
                for (unsigned int i = 0; i < q->moves; i++) {
                        fprintf(stderr, "%s(%x:%.3f) ", coord2sstr(q->move[i], b), q->tag[i], fixp_to_double(pd[i]));
                }
                fprintf(stderr, "\n");
        }
        for (unsigned int i = 0; i < q->moves; i++) {
                //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));
                if (stab < pd[i])
                        return q->move[i];
                stab -= pd[i];
        }

        /* Tenuki. */
        assert(stab < double_to_fixp(pp->tenuki_prob));
        return pass;
}

coord_t
playout_moggy_fullchoose(struct playout_policy *p, struct playout_setup *s, struct board *b, enum stone to_play)
{
        struct moggy_policy *pp = p->data;
        struct move_queue q; q.moves = 0;

        if (PLDEBUGL(5))
                board_print(b, stderr);

        /* Ko fight check */
        if (pp->korate > 0 && !is_pass(b->last_ko.coord) && is_pass(b->ko.coord)
            && b->moves - b->last_ko_age < pp->koage) {
                if (board_is_valid_play(b, to_play, b->last_ko.coord)
                    && !is_bad_selfatari(b, to_play, b->last_ko.coord))
                        mq_add(&q, b->last_ko.coord, 1<<MQ_KO);
        }

        /* Local checks */
        if (!is_pass(b->last_move.coord)) {
                /* Nakade check */
                if (pp->nakaderate > 0 && immediate_liberty_count(b, b->last_move.coord) > 0) {
                        coord_t nakade = nakade_check(p, b, &b->last_move, to_play);
                        if (!is_pass(nakade))
                                mq_add(&q, nakade, 1<<MQ_NAKADE);
                }

                /* Local group in atari? */
                if (pp->lcapturerate > 0)
                        local_atari_check(p, b, &b->last_move, &q);

                /* Local group trying to escape ladder? */
                if (pp->ladderrate > 0)
                        local_ladder_check(p, b, &b->last_move, &q);

                struct libmap_mq lmq = { .mq = { .moves = 0 } };

                /* Local group can be PUT in atari? */
                if (pp->atarirate > 0)
                        local_2lib_check(p, b, &b->last_move, &lmq);

                /* Local group reduced some of our groups to 3 libs? */
                if (pp->nlibrate > 0)
                        local_nlib_check(p, b, &b->last_move, &lmq);

                mq_append(&q, &lmq.mq);

                /* Some other semeai-ish shape checks */
                if (pp->eyefixrate > 0)
                        eye_fix_check(p, b, &b->last_move, to_play, &q);

                /* Check for patterns we know */
                if (pp->patternrate > 0) {
                        fixp_t gammas[MQL];
                        apply_pattern(p, b, &b->last_move,
                                        pp->pattern2 && b->last_move2.coord >= 0 ? &b->last_move2 : NULL,
                                        &q, gammas);
                        /* FIXME: Use the gammas. */
                }
        }

        /* Global checks */

        /* Any groups in atari? */
        if (pp->capturerate > 0)
                global_atari_check(p, b, to_play, &q);

        /* Joseki moves? */
        if (pp->josekirate > 0)
                joseki_check(p, b, to_play, &q);

#if 0
        /* Average length of the queue is 1.4 move. */
        printf("MQL %d ", q.moves);
        for (unsigned int i = 0; i < q.moves; i++)
                printf("%s ", coord2sstr(q.move[i], b));
        printf("\n");
#endif

        if (q.moves > 0)
                return mq_tagged_choose(p, b, to_play, &q);

        /* Fill board */
        if (pp->fillboardtries > 0) {
                coord_t c = fillboard_check(p, b);
                if (!is_pass(c))
                        return c;
        }

        return pass;
}


void
playout_moggy_assess_group(struct playout_policy *p, struct prior_map *map, group_t g, int games)
{
        struct moggy_policy *pp = p->data;
        struct board *b = map->b;

        if (board_group_info(b, g).libs > pp->nlib_count)
                return;

        if (PLDEBUGL(5)) {
                fprintf(stderr, "ASSESS of group %s:\n", coord2sstr(g, b));
                board_print(b, stderr);
        }

        if (board_group_info(b, g).libs > 2) {
                if (!pp->nlibrate)
                        return;
                if (board_at(b, g) != map->to_play)
                        return; // we do only defense
                /* TODO: Tie libmap info into tree search. */
                struct libmap_mq q; q.mq.moves = 0;
                group_nlib_defense_check(b, g, map->to_play, &q, 0);
                while (q.mq.moves--) {
                        coord_t coord = q.mq.move[q.mq.moves];
                        if (PLDEBUGL(5))
                                fprintf(stderr, "1.0: nlib %s\n", coord2sstr(coord, b));
                        int assess = games / 2;
                        add_prior_value(map, coord, 1, assess);
                }
                return;
        }

        if (board_group_info(b, g).libs == 2) {
                if (pp->ladderrate) {
                        /* Make sure to play the correct liberty in case
                         * this is a group that can be caught in a ladder. */
                        bool ladderable = false;
                        for (int i = 0; i < 2; i++) {
                                coord_t chase = board_group_info(b, g).lib[i];
                                coord_t escape = board_group_info(b, g).lib[1 - i];
                                if (wouldbe_ladder(b, g, escape, chase, board_at(b, g))) {
                                        add_prior_value(map, chase, 1, games);
                                        ladderable = true;
                                }
                        }
                        if (ladderable)
                                return; // do not suggest the other lib at all
                }

                if (!pp->atarirate)
                        return;
                struct libmap_mq q; q.mq.moves = 0;
                group_2lib_check(b, g, map->to_play, &q, 0, pp->atari_miaisafe, pp->atari_def_no_hopeless);
                while (q.mq.moves--) {
                        coord_t coord = q.mq.move[q.mq.moves];
                        if (PLDEBUGL(5))
                                fprintf(stderr, "1.0: 2lib %s\n", coord2sstr(coord, b));
                        int assess = games / 2;
                        add_prior_value(map, coord, 1, assess);
                }
                return;
        }

        /* This group, sir, is in atari! */

        struct move_queue q; q.moves = 0;
        coord_t ladder = pass;
        group_atari_check(pp->alwaysccaprate, b, g, map->to_play, &q, &ladder, true, 0);
        while (q.moves--) {
                coord_t coord = q.move[q.moves];

                /* _Never_ play here if this move plays out
                 * a caught ladder. */
                if (coord == ladder && !board_playing_ko_threat(b)) {
                        /* Note that the opposite is not guarded against;
                         * we do not advise against capturing a laddered
                         * group (but we don't encourage it either). Such
                         * a move can simplify tactical situations if we
                         * can afford it. */
                        if (map->to_play != board_at(b, g))
                                continue;
                        /* FIXME: We give the malus even if this move
                         * captures another group. */
                        if (PLDEBUGL(5))
                                fprintf(stderr, "0.0: ladder %s\n", coord2sstr(coord, b));
                        add_prior_value(map, coord, 0, games);
                        continue;
                }

                if (!pp->capturerate && !pp->lcapturerate)
                        continue;

                int assess = games * 2;
                if (pp->cap_stone_denom > 0) {
                        int stones = group_stone_count(b, g, pp->cap_stone_max) - (pp->cap_stone_min-1);
                        assess += (stones > 0 ? stones : 0) * games * 100 / pp->cap_stone_denom;
                }
                if (PLDEBUGL(5))
                        fprintf(stderr, "1.0 (%d): atari %s\n", assess, coord2sstr(coord, b));
                add_prior_value(map, coord, 1, assess);
        }
}

void
playout_moggy_assess_one(struct playout_policy *p, struct prior_map *map, coord_t coord, int games)
{
        struct moggy_policy *pp = p->data;
        struct board *b = map->b;

        if (PLDEBUGL(5)) {
                fprintf(stderr, "ASSESS of move %s:\n", coord2sstr(coord, b));
                board_print(b, stderr);
        }

        /* Is this move a self-atari? */
        if (pp->selfatarirate) {
                if (!board_playing_ko_threat(b) && is_bad_selfatari(b, map->to_play, coord)) {
                        if (PLDEBUGL(5))
                                fprintf(stderr, "0.0: self-atari\n");
                        add_prior_value(map, coord, 0, games);
                        if (!pp->selfatari_other)
                                return;
                        /* If we can play on the other liberty of the
                         * endangered group, do! */
                        coord = selfatari_cousin(b, map->to_play, coord, NULL);
                        if (is_pass(coord))
                                return;
                        if (PLDEBUGL(5))
                                fprintf(stderr, "1.0: self-atari redirect %s\n", coord2sstr(coord, b));
                        add_prior_value(map, coord, 1.0, games);
                        return;
                }
        }

        /* Pattern check */
        if (pp->patternrate) {
                // XXX: Use gamma value?
                struct move m = { .color = map->to_play, .coord = coord };
                if (test_pattern3_here(p, b, &m, true, NULL)) {
                        if (PLDEBUGL(5))
                                fprintf(stderr, "1.0: pattern\n");
                        add_prior_value(map, coord, 1, games);
                }
        }

        return;
}

void
playout_moggy_assess(struct playout_policy *p, struct prior_map *map, int games)
{
        struct moggy_policy *pp = p->data;

        /* First, go through all endangered groups. */
        for (group_t g = 1; g < board_size2(map->b); g++)
                if (group_at(map->b, g) == g)
                        playout_moggy_assess_group(p, map, g, games);

        /* Then, assess individual moves. */
        if (!pp->patternrate && !pp->selfatarirate)
                return;
        foreach_free_point(map->b) {
                if (map->consider[c])
                        playout_moggy_assess_one(p, map, c, games);
        } foreach_free_point_end;
}

bool
playout_moggy_permit(struct playout_policy *p, struct board *b, struct move *m)
{
        struct moggy_policy *pp = p->data;

        /* The idea is simple for now - never allow self-atari moves.
         * They suck in general, but this also permits us to actually
         * handle seki in the playout stage. */

        if (fast_random(100) >= pp->selfatarirate) {
                if (PLDEBUGL(5))
                        fprintf(stderr, "skipping sar test\n");
                goto sar_skip;
        }
        bool selfatari = is_bad_selfatari(b, m->color, m->coord);
        if (selfatari) {
                if (PLDEBUGL(5))
                        fprintf(stderr, "__ Prohibiting self-atari %s %s\n",
                                stone2str(m->color), coord2sstr(m->coord, b));
                if (pp->selfatari_other) {
                        /* Ok, try the other liberty of the atari'd group. */
                        coord_t c = selfatari_cousin(b, m->color, m->coord, NULL);
                        if (is_pass(c)) return false;
                        if (PLDEBUGL(5))
                                fprintf(stderr, "___ Redirecting to other lib %s\n",
                                        coord2sstr(c, b));
                        m->coord = c;
                        return true;
                }
                return false;
        }
sar_skip:

        /* Check if we don't seem to be filling our eye. This should
         * happen only for false eyes, but some of them are in fact
         * real eyes with diagonal filled by a dead stone. Prefer
         * to counter-capture in that case. */
        if (fast_random(100) >= pp->eyefillrate) {
                if (PLDEBUGL(5))
                        fprintf(stderr, "skipping eyefill test\n");
                goto eyefill_skip;
        }
        bool eyefill = board_is_eyelike(b, m->coord, m->color);
        if (eyefill) {
                foreach_diag_neighbor(b, m->coord) {
                        if (board_at(b, c) != stone_other(m->color))
                                continue;
                        switch (board_group_info(b, group_at(b, c)).libs) {
                        case 1: /* Capture! */
                                c = board_group_info(b, group_at(b, c)).lib[0];
                                if (PLDEBUGL(5))
                                        fprintf(stderr, "___ Redirecting to capture %s\n",
                                                coord2sstr(c, b));
                                m->coord = c;
                                return true;
                        case 2: /* Try to switch to some 2-lib neighbor. */
                                for (int i = 0; i < 2; i++) {
                                        coord_t l = board_group_info(b, group_at(b, c)).lib[i];
                                        if (board_is_one_point_eye(b, l, board_at(b, c)))
                                                continue;
                                        if (is_bad_selfatari(b, m->color, l))
                                                continue;
                                        m->coord = l;
                                        return true;
                                }
                                break;
                        }
                } foreach_diag_neighbor_end;
        }

eyefill_skip:
        return true;
}


struct playout_policy *
playout_moggy_init(char *arg, struct board *b, struct joseki_dict *jdict)
{
        struct playout_policy *p = calloc2(1, sizeof(*p));
        struct moggy_policy *pp = calloc2(1, sizeof(*pp));
        p->data = pp;
        p->choose = playout_moggy_seqchoose;
        p->assess = playout_moggy_assess;
        p->permit = playout_moggy_permit;

        pp->jdict = jdict;

        /* These settings are tuned for 19x19 play with several threads
         * on reasonable time limits (i.e., rather large number of playouts).
         * XXX: no 9x9 tuning has been done recently. */
        int rate = board_large(b) ? 80 : 90;

        pp->lcapturerate = pp->atarirate = pp->nlibrate
                = pp->josekirate = -1U;
        pp->patternrate = pp->eyefixrate = 100;
        pp->nlibrate = 20;
        pp->nakaderate = 20;
        pp->pattern2 = true;
        pp->lcapturerate = 90;
        pp->korate = 20; pp->koage = 4;
        pp->alwaysccaprate = 40;
        pp->eyefillrate = 60;

        /* selfatarirate is slightly special, since to avoid playing some
         * silly move that stays on the board, it needs to block it many
         * times during a simulation - we'd like that to happen in most
         * simulations, so we try to use a very high selfatarirate.
         * XXX: Perhaps it would be better to permanently ban moves in
         * the current simulation after testing them once. */
        pp->selfatarirate = 95;
        pp->selfatari_other = true;

        pp->cap_stone_min = 2;
        pp->cap_stone_max = 15;
        pp->cap_stone_denom = 200;

        pp->atari_def_no_hopeless = !board_large(b);
        pp->atari_miaisafe = true;
        pp->nlib_count = 4;

        /* C is stupid. */
        double mq_prob_default[MQ_MAX] = {
                [MQ_KO] = 6.0,
                [MQ_NAKADE] = 5.5,
                [MQ_LATARI] = 5.0,
                [MQ_L2LIB] = 4.0,
                [MQ_LNLIB] = 3.5,
                [MQ_PAT3] = 3.0,
                [MQ_GATARI] = 2.0,
                [MQ_JOSEKI] = 1.0,
        };
        memcpy(pp->mq_prob, mq_prob_default, sizeof(pp->mq_prob));

        /* Default 3x3 pattern gammas tuned on 15x15 with 500s/game on
         * i7-3770 single thread using 40000 CLOP games. */
        double pat3_gammas_default[PAT3_N] = {
                0.52, 0.53, 0.32, 0.22, 0.37, 0.28, 0.21, 0.19, 0.82,
                0.12, 0.20, 0.11, 0.16, 0.57, 0.44
        };
        memcpy(pp->pat3_gammas, pat3_gammas_default, sizeof(pp->pat3_gammas));

        if (arg) {
                char *optspec, *next = arg;
                while (*next) {
                        optspec = next;
                        next += strcspn(next, ":");
                        if (*next) { *next++ = 0; } else { *next = 0; }

                        char *optname = optspec;
                        char *optval = strchr(optspec, '=');
                        if (optval) *optval++ = 0;

                        if (!strcasecmp(optname, "debug") && optval) {
                                p->debug_level = atoi(optval);
                        } else if (!strcasecmp(optname, "lcapturerate") && optval) {
                                pp->lcapturerate = atoi(optval);
                        } else if (!strcasecmp(optname, "ladderrate") && optval) {
                                pp->ladderrate = atoi(optval);
                        } else if (!strcasecmp(optname, "atarirate") && optval) {
                                pp->atarirate = atoi(optval);
                        } else if (!strcasecmp(optname, "nlibrate") && optval) {
                                pp->nlibrate = atoi(optval);
                        } else if (!strcasecmp(optname, "capturerate") && optval) {
                                pp->capturerate = atoi(optval);
                        } else if (!strcasecmp(optname, "patternrate") && optval) {
                                pp->patternrate = atoi(optval);
                        } else if (!strcasecmp(optname, "selfatarirate") && optval) {
                                pp->selfatarirate = atoi(optval);
                        } else if (!strcasecmp(optname, "eyefillrate") && optval) {
                                pp->eyefillrate = atoi(optval);
                        } else if (!strcasecmp(optname, "korate") && optval) {
                                pp->korate = atoi(optval);
                        } else if (!strcasecmp(optname, "josekirate") && optval) {
                                pp->josekirate = atoi(optval);
                        } else if (!strcasecmp(optname, "nakaderate") && optval) {
                                pp->nakaderate = atoi(optval);
                        } else if (!strcasecmp(optname, "eyefixrate") && optval) {
                                pp->eyefixrate = atoi(optval);
                        } else if (!strcasecmp(optname, "alwaysccaprate") && optval) {
                                pp->alwaysccaprate = atoi(optval);
                        } else if (!strcasecmp(optname, "rate") && optval) {
                                rate = atoi(optval);
                        } else if (!strcasecmp(optname, "fillboardtries")) {
                                pp->fillboardtries = atoi(optval);
                        } else if (!strcasecmp(optname, "koage") && optval) {
                                pp->koage = atoi(optval);
                        } else if (!strcasecmp(optname, "pattern2")) {
                                pp->pattern2 = optval && *optval == '0' ? false : true;
                        } else if (!strcasecmp(optname, "selfatari_other")) {
                                pp->selfatari_other = optval && *optval == '0' ? false : true;
                        } else if (!strcasecmp(optname, "capcheckall")) {
                                pp->capcheckall = optval && *optval == '0' ? false : true;
                        } else if (!strcasecmp(optname, "cap_stone_min") && optval) {
                                pp->cap_stone_min = atoi(optval);
                        } else if (!strcasecmp(optname, "cap_stone_max") && optval) {
                                pp->cap_stone_max = atoi(optval);
                        } else if (!strcasecmp(optname, "cap_stone_denom") && optval) {
                                pp->cap_stone_denom = atoi(optval);
                        } else if (!strcasecmp(optname, "atari_miaisafe")) {
                                pp->atari_miaisafe = optval && *optval == '0' ? false : true;
                        } else if (!strcasecmp(optname, "atari_def_no_hopeless")) {
                                pp->atari_def_no_hopeless = optval && *optval == '0' ? false : true;
                        } else if (!strcasecmp(optname, "nlib_count") && optval) {
                                pp->nlib_count = atoi(optval);
                        } else if (!strcasecmp(optname, "middle_ladder")) {
                                pp->middle_ladder = optval && *optval == '0' ? false : true;
                        } else if (!strcasecmp(optname, "fullchoose")) {
                                pp->fullchoose = true;
                                p->choose = optval && *optval == '0' ? playout_moggy_seqchoose : playout_moggy_fullchoose;
                        } else if (!strcasecmp(optname, "mqprob") && optval) {
                                /* KO%LATARI%L2LIB%LNLIB%PAT3%GATARI%JOSEKI%NAKADE */
                                for (int i = 0; *optval && i < MQ_MAX; i++) {
                                        pp->mq_prob[i] = atof(optval);
                                        optval += strcspn(optval, "%");
                                        if (*optval) optval++;
                                }
                        } else if (!strcasecmp(optname, "pat3gammas") && optval) {
                                /* PAT3_N %-separated floating point values */
                                for (int i = 0; *optval && i < PAT3_N; i++) {
                                        pp->pat3_gammas[i] = atof(optval);
                                        optval += strcspn(optval, "%");
                                        if (*optval) optval++;
                                }
                        } else if (!strcasecmp(optname, "tenukiprob") && optval) {
                                pp->tenuki_prob = atof(optval);
                        } else {
                                fprintf(stderr, "playout-moggy: Invalid policy argument %s or missing value\n", optname);
                                exit(1);
                        }
                }
        }
        if (pp->lcapturerate == -1U) pp->lcapturerate = rate;
        if (pp->atarirate == -1U) pp->atarirate = rate;
        if (pp->nlibrate == -1U) pp->nlibrate = rate;
        if (pp->capturerate == -1U) pp->capturerate = rate;
        if (pp->patternrate == -1U) pp->patternrate = rate;
        if (pp->selfatarirate == -1U) pp->selfatarirate = rate;
        if (pp->eyefillrate == -1U) pp->eyefillrate = rate;
        if (pp->korate == -1U) pp->korate = rate;
        if (pp->josekirate == -1U) pp->josekirate = rate;
        if (pp->ladderrate == -1U) pp->ladderrate = rate;
        if (pp->nakaderate == -1U) pp->nakaderate = rate;
        if (pp->eyefixrate == -1U) pp->eyefixrate = rate;
        if (pp->alwaysccaprate == -1U) pp->alwaysccaprate = rate;

        pattern3s_init(&pp->patterns, moggy_patterns_src, moggy_patterns_src_n);

        return p;
}