playout.c

   1 #define DEBUG
   2 #include <assert.h>
   3 #include <math.h>
   4 #include <stdio.h>
   5 #include <stdlib.h>
   6 #include <string.h>
   7
   8 #include "board.h"
   9 #include "debug.h"
  10 #include "engine.h"
  11 #include "move.h"
  12 #include "ownermap.h"
  13 #include "playout.h"
  14
  15 /* Whether to set global debug level to the same as the playout
  16  * has, in case it is different. This can make sure e.g. tactical
  17  * reading produces proper level of debug prints during simulations.
  18  * But it is safe to enable this only in single-threaded instances! */
  19 //#define DEBUGL_BY_PLAYOUT
  20
  21 #define PLDEBUGL(n) DEBUGL_(policy->debug_level, n)
  22
  23
  24 coord_t
  25 play_random_move(struct playout_setup *setup,
  26                  struct board *b, enum stone color,
  27                  struct playout_policy *policy)
  28 {
  29         coord_t coord = pass;
  30
  31         if (setup->prepolicy_hook) {
  32                 coord = setup->prepolicy_hook(policy, setup, b, color);
  33                 // fprintf(stderr, "prehook: %s\n", coord2sstr(coord, b));
  34         }
  35
  36         if (is_pass(coord)) {
  37                 coord = policy->choose(policy, setup, b, color);
  38                 // fprintf(stderr, "policy: %s\n", coord2sstr(coord, b));
  39         }
  40
  41         if (is_pass(coord) && setup->postpolicy_hook) {
  42                 coord = setup->postpolicy_hook(policy, setup, b, color);
  43                 // fprintf(stderr, "posthook: %s\n", coord2sstr(coord, b));
  44         }
  45
  46         if (is_pass(coord)) {
  47 play_random:
  48                 /* Defer to uniformly random move choice. */
  49                 /* This must never happen if the policy is tracking
  50                  * internal board state, obviously. */
  51                 assert(!policy->setboard);
  52                 board_play_random(b, color, &coord, (ppr_permit) policy->permit, policy);
  53
  54         } else {
  55                 struct move m;
  56                 m.coord = coord; m.color = color;
  57                 if (board_play(b, &m) < 0) {
  58                         if (PLDEBUGL(4)) {
  59                                 fprintf(stderr, "Pre-picked move %d,%d is ILLEGAL:\n",
  60                                         coord_x(coord, b), coord_y(coord, b));
  61                                 board_print(b, stderr);
  62                         }
  63                         goto play_random;
  64                 }
  65         }
  66
  67         return coord;
  68 }
  69
  70 int
  71 play_random_game(struct playout_setup *setup,
  72                  struct board *b, enum stone starting_color,
  73                  struct playout_amafmap *amafmap,
  74                  struct board_ownermap *ownermap,
  75                  struct playout_policy *policy)
  76 {
  77         assert(setup && policy);
  78
  79         int gamelen = setup->gamelen - b->moves;
  80         if (gamelen < 10)
  81                 gamelen = 10;
  82
  83         if (policy->setboard)
  84                 policy->setboard(policy, b);
  85 #ifdef DEBUGL_BY_PLAYOUT
  86         int debug_level_orig = debug_level;
  87         debug_level = policy->debug_level;
  88 #endif
  89
  90         enum stone color = starting_color;
  91
  92         int passes = is_pass(b->last_move.coord) && b->moves > 0;
  93
  94         while (gamelen-- && passes < 2) {
  95                 coord_t coord = play_random_move(setup, b, color, policy);
  96
  97 #if 0
  98                 /* For UCT, superko test here is downright harmful since
  99                  * in superko-likely situation we throw away literally
 100                  * 95% of our playouts; UCT will deal with this fine by
 101                  * itself. */
 102                 if (unlikely(b->superko_violation)) {
 103                         /* We ignore superko violations that are suicides. These
 104                          * are common only at the end of the game and are
 105                          * rather harmless. (They will not go through as a root
 106                          * move anyway.) */
 107                         if (group_at(b, coord)) {
 108                                 if (DEBUGL(3)) {
 109                                         fprintf(stderr, "Superko fun at %d,%d in\n", coord_x(coord, b), coord_y(coord, b));
 110                                         if (DEBUGL(4))
 111                                                 board_print(b, stderr);
 112                                 }
 113                                 return 0;
 114                         } else {
 115                                 if (DEBUGL(6)) {
 116                                         fprintf(stderr, "Ignoring superko at %d,%d in\n", coord_x(coord, b), coord_y(coord, b));
 117                                         board_print(b, stderr);
 118                                 }
 119                                 b->superko_violation = false;
 120                         }
 121                 }
 122 #endif
 123
 124                 if (PLDEBUGL(7)) {
 125                         fprintf(stderr, "%s %s\n", stone2str(color), coord2sstr(coord, b));
 126                         if (PLDEBUGL(8))
 127                                 board_print(b, stderr);
 128                 }
 129
 130                 if (unlikely(is_pass(coord))) {
 131                         passes++;
 132                 } else {
 133                         /* We don't care about nakade counters, since we want
 134                          * to avoid taking pre-nakade moves into account only
 135                          * if they happenned in the tree before nakade nodes;
 136                          * but this is always out of the tree. */
 137                         if (amafmap) {
 138                                 if (amafmap->map[coord] == S_NONE || amafmap->map[coord] == color)
 139                                         amafmap->map[coord] = color;
 140                                 else if (amafmap->record_nakade)
 141                                         amaf_op(amafmap->map[coord], +);
 142                                 amafmap->game[amafmap->gamelen].coord = coord;
 143                                 amafmap->game[amafmap->gamelen].color = color;
 144                                 amafmap->gamelen++;
 145                                 assert(amafmap->gamelen < sizeof(amafmap->game) / sizeof(amafmap->game[0]));
 146                         }
 147
 148                         passes = 0;
 149                 }
 150
 151                 if (setup->mercymin && abs(b->captures[S_BLACK] - b->captures[S_WHITE]) > setup->mercymin)
 152                         break;
 153
 154                 color = stone_other(color);
 155         }
 156
 157         floating_t score = board_fast_score(b);
 158         int result = (starting_color == S_WHITE ? score * 2 : - (score * 2));
 159
 160         if (DEBUGL(6)) {
 161                 fprintf(stderr, "Random playout result: %d (W %f)\n", result, score);
 162                 if (DEBUGL(7))
 163                         board_print(b, stderr);
 164         }
 165
 166         if (ownermap)
 167                 board_ownermap_fill(ownermap, b);
 168
 169         if (b->ps)
 170                 free(b->ps);
 171
 172 #ifdef DEBUGL_BY_PLAYOUT
 173         debug_level = debug_level_orig;
 174 #endif
 175
 176         return result;
 177 }