uct/walk.c

   1 #include <assert.h>
   2 #include <pthread.h>
   3 #include <signal.h>
   4 #include <stdio.h>
   5 #include <stdlib.h>
   6 #include <string.h>
   7
   8 #define DEBUG
   9
  10 #include "debug.h"
  11 #include "board.h"
  12 #include "move.h"
  13 #include "playout.h"
  14 #include "probdist.h"
  15 #include "random.h"
  16 #include "tactics.h"
  17 #include "uct/internal.h"
  18 #include "uct/tree.h"
  19 #include "uct/uct.h"
  20 #include "uct/walk.h"
  21
  22 float
  23 uct_get_extra_komi(struct uct *u, struct board *b)
  24 {
  25         float extra_komi = board_effective_handicap(b) * (u->dynkomi - b->moves) / u->dynkomi;
  26         return extra_komi;
  27 }
  28
  29 void
  30 uct_progress_status(struct uct *u, struct tree *t, enum stone color, int playouts)
  31 {
  32         if (!UDEBUGL(0))
  33                 return;
  34
  35         /* Best move */
  36         struct tree_node *best = u->policy->choose(u->policy, t->root, t->board, color);
  37         if (!best) {
  38                 fprintf(stderr, "... No moves left\n");
  39                 return;
  40         }
  41         fprintf(stderr, "[%d] ", playouts);
  42         fprintf(stderr, "best %f ", tree_node_get_value(t, 1, best->u.value));
  43
  44         /* Max depth */
  45         fprintf(stderr, "deepest % 2d ", t->max_depth - t->root->depth);
  46
  47         /* Best sequence */
  48         fprintf(stderr, "| seq ");
  49         for (int depth = 0; depth < 6; depth++) {
  50                 if (best && best->u.playouts >= 25) {
  51                         fprintf(stderr, "%3s ", coord2sstr(best->coord, t->board));
  52                         best = u->policy->choose(u->policy, best, t->board, color);
  53                 } else {
  54                         fprintf(stderr, "    ");
  55                 }
  56         }
  57
  58         /* Best candidates */
  59         fprintf(stderr, "| can ");
  60         int cans = 4;
  61         struct tree_node *can[cans];
  62         memset(can, 0, sizeof(can));
  63         best = t->root->children;
  64         while (best) {
  65                 int c = 0;
  66                 while ((!can[c] || best->u.playouts > can[c]->u.playouts) && ++c < cans);
  67                 for (int d = 0; d < c; d++) can[d] = can[d + 1];
  68                 if (c > 0) can[c - 1] = best;
  69                 best = best->sibling;
  70         }
  71         while (--cans >= 0) {
  72                 if (can[cans]) {
  73                         fprintf(stderr, "%3s(%.3f) ",
  74                                 coord2sstr(can[cans]->coord, t->board),
  75                                 tree_node_get_value(t, 1, can[cans]->u.value));
  76                 } else {
  77                         fprintf(stderr, "           ");
  78                 }
  79         }
  80
  81         fprintf(stderr, "\n");
  82 }
  83
  84
  85 static int
  86 uct_leaf_node(struct uct *u, struct board *b, enum stone player_color,
  87               struct playout_amafmap *amaf,
  88               struct tree *t, struct tree_node *n, enum stone node_color,
  89               char *spaces)
  90 {
  91         enum stone next_color = stone_other(node_color);
  92         int parity = (next_color == player_color ? 1 : -1);
  93
  94         /* If we don't anticipate well the opponent move during pondering
  95          * (the played move has few playouts) we still need more memory
  96          * during genmove to explore the tree actually played. */
  97         unsigned long max_tree_size = u->max_tree_size;
  98         if (u->pondering)
  99                 max_tree_size = (max_tree_size * (100 - MIN_FREE_MEM_PERCENT)) / 100;
 100
 101         /* We need to make sure only one thread expands the node. If
 102          * we are unlucky enough for two threads to meet in the same
 103          * node, the latter one will simply do another simulation from
 104          * the node itself, no big deal. t->nodes_size may exceed
 105          * the maximum in multi-threaded case but not by much so it's ok.
 106          * The size test must be before the test&set not after, to allow
 107          * expansion of the node later if enough nodes have been freed. */
 108         if (n->u.playouts >= u->expand_p && t->nodes_size < max_tree_size
 109             && !__sync_lock_test_and_set(&n->is_expanded, 1)) {
 110                 tree_expand_node(t, n, b, next_color, u, parity);
 111         }
 112         if (UDEBUGL(7))
 113                 fprintf(stderr, "%s*-- UCT playout #%d start [%s] %f\n",
 114                         spaces, n->u.playouts, coord2sstr(n->coord, t->board),
 115                         tree_node_get_value(t, parity, n->u.value));
 116
 117         struct playout_setup ps = { .gamelen = u->gamelen, .mercymin = u->mercymin };
 118         int result = play_random_game(&ps, b, next_color,
 119                                       u->playout_amaf ? amaf : NULL,
 120                                       &u->ownermap, u->playout);
 121         if (next_color == S_WHITE) {
 122                 /* We need the result from black's perspective. */
 123                 result = - result;
 124         }
 125         if (UDEBUGL(7))
 126                 fprintf(stderr, "%s -- [%d..%d] %s random playout result %d\n",
 127                         spaces, player_color, next_color, coord2sstr(n->coord, t->board), result);
 128
 129         return result;
 130 }
 131
 132 static float
 133 scale_value(struct uct *u, struct board *b, int result)
 134 {
 135         float rval = result > 0;
 136         if (u->val_scale) {
 137                 int vp = u->val_points;
 138                 if (!vp) {
 139                         vp = board_size(b) - 1; vp *= vp; vp *= 2;
 140                 }
 141
 142                 float sval = (float) abs(result) / vp;
 143                 sval = sval > 1 ? 1 : sval;
 144                 if (result < 0) sval = 1 - sval;
 145                 if (u->val_extra)
 146                         rval += u->val_scale * sval;
 147                 else
 148                         rval = (1 - u->val_scale) * rval + u->val_scale * sval;
 149                 // fprintf(stderr, "score %d => sval %f, rval %f\n", result, sval, rval);
 150         }
 151         return rval;
 152 }
 153
 154
 155 int
 156 uct_playout(struct uct *u, struct board *b, enum stone player_color, struct tree *t)
 157 {
 158         struct board b2;
 159         board_copy(&b2, b);
 160
 161         struct playout_amafmap *amaf = NULL;
 162         if (u->policy->wants_amaf) {
 163                 amaf = calloc(1, sizeof(*amaf));
 164                 amaf->map = calloc(board_size2(&b2) + 1, sizeof(*amaf->map));
 165                 amaf->map++; // -1 is pass
 166         }
 167
 168         /* Walk the tree until we find a leaf, then expand it and do
 169          * a random playout. */
 170         struct tree_node *n = t->root;
 171         enum stone node_color = stone_other(player_color);
 172         assert(node_color == t->root_color);
 173
 174         void *dstate = NULL, *dstater = NULL;
 175
 176         int result;
 177         int pass_limit = (board_size(&b2) - 2) * (board_size(&b2) - 2) / 2;
 178         int passes = is_pass(b->last_move.coord) && b->moves > 0;
 179
 180         /* debug */
 181         int depth = 0;
 182         static char spaces[] = "\0                                                      ";
 183         /* /debug */
 184         if (UDEBUGL(8))
 185                 fprintf(stderr, "--- UCT walk with color %d\n", player_color);
 186
 187         while (!tree_leaf_node(n) && passes < 2) {
 188                 spaces[depth++] = ' '; spaces[depth] = 0;
 189
 190                 /* Parity is chosen already according to the child color, since
 191                  * it is applied to children. */
 192                 node_color = stone_other(node_color);
 193                 int parity = (node_color == player_color ? 1 : -1);
 194                 n = (!u->random_policy_chance || fast_random(u->random_policy_chance))
 195                         ? u->policy->descend(u->policy, &dstate, t, n, parity, b2.moves > pass_limit)
 196                         : u->random_policy->descend(u->random_policy, &dstater, t, n, parity, b2.moves > pass_limit);
 197
 198                 assert(n == t->root || n->parent);
 199                 if (UDEBUGL(7))
 200                         fprintf(stderr, "%s+-- UCT sent us to [%s:%d] %f\n",
 201                                 spaces, coord2sstr(n->coord, t->board), n->coord,
 202                                 tree_node_get_value(t, parity, n->u.value));
 203
 204                 /* Add virtual loss if we need to; this is used to discourage
 205                  * other threads from visiting this node in case of multiple
 206                  * threads doing the tree search. */
 207                 if (u->virtual_loss)
 208                         stats_add_result(&n->u, tree_parity(t, parity) > 0 ? 0 : 1, 1);
 209
 210                 assert(n->coord >= -1);
 211                 if (amaf && !is_pass(n->coord)) {
 212                         if (amaf->map[n->coord] == S_NONE || amaf->map[n->coord] == node_color) {
 213                                 amaf->map[n->coord] = node_color;
 214                         } else { // XXX: Respect amaf->record_nakade
 215                                 amaf_op(amaf->map[n->coord], +);
 216                         }
 217                         amaf->game[amaf->gamelen].coord = n->coord;
 218                         amaf->game[amaf->gamelen].color = node_color;
 219                         amaf->gamelen++;
 220                         assert(amaf->gamelen < sizeof(amaf->game) / sizeof(amaf->game[0]));
 221                 }
 222
 223                 struct move m = { n->coord, node_color };
 224                 int res = board_play(&b2, &m);
 225
 226                 if (res < 0 || (!is_pass(m.coord) && !group_at(&b2, m.coord)) /* suicide */
 227                     || b2.superko_violation) {
 228                         if (UDEBUGL(3)) {
 229                                 for (struct tree_node *ni = n; ni; ni = ni->parent)
 230                                         fprintf(stderr, "%s<%"PRIhash"> ", coord2sstr(ni->coord, t->board), ni->hash);
 231                                 fprintf(stderr, "marking invalid %s node %d,%d res %d group %d spk %d\n",
 232                                         stone2str(node_color), coord_x(n->coord,b), coord_y(n->coord,b),
 233                                         res, group_at(&b2, m.coord), b2.superko_violation);
 234                         }
 235                         n->hints |= TREE_HINT_INVALID;
 236                         result = 0;
 237                         goto end;
 238                 }
 239
 240                 if (is_pass(n->coord))
 241                         passes++;
 242                 else
 243                         passes = 0;
 244         }
 245
 246         if (amaf) {
 247                 amaf->game_baselen = amaf->gamelen;
 248                 amaf->record_nakade = u->playout_amaf_nakade;
 249         }
 250
 251         if (u->dynkomi > b2.moves && (player_color & u->dynkomi_mask))
 252                 b2.komi += uct_get_extra_komi(u, &b2);
 253
 254         if (passes >= 2) {
 255                 /* XXX: No dead groups support. */
 256                 float score = board_official_score(&b2, NULL);
 257                 /* Result from black's perspective (no matter who
 258                  * the player; black's perspective is always
 259                  * what the tree stores. */
 260                 result = - (score * 2);
 261
 262                 if (UDEBUGL(5))
 263                         fprintf(stderr, "[%d..%d] %s p-p scoring playout result %d (W %f)\n",
 264                                 player_color, node_color, coord2sstr(n->coord, t->board), result, score);
 265                 if (UDEBUGL(6))
 266                         board_print(&b2, stderr);
 267
 268                 board_ownermap_fill(&u->ownermap, &b2);
 269
 270         } else { assert(u->parallel_tree || tree_leaf_node(n));
 271                 /* In case of parallel tree search, the assertion might
 272                  * not hold if two threads chew on the same node. */
 273                 result = uct_leaf_node(u, &b2, player_color, amaf, t, n, node_color, spaces);
 274         }
 275
 276         if (amaf && u->playout_amaf_cutoff) {
 277                 int cutoff = amaf->game_baselen;
 278                 cutoff += (amaf->gamelen - amaf->game_baselen) * u->playout_amaf_cutoff / 100;
 279                 /* Now, reconstruct the amaf map. */
 280                 memset(amaf->map, 0, board_size2(&b2) * sizeof(*amaf->map));
 281                 for (int i = 0; i < cutoff; i++) {
 282                         coord_t coord = amaf->game[i].coord;
 283                         enum stone color = amaf->game[i].color;
 284                         if (amaf->map[coord] == S_NONE || amaf->map[coord] == color) {
 285                                 amaf->map[coord] = color;
 286                         /* Nakade always recorded for in-tree part */
 287                         } else if (amaf->record_nakade || i <= amaf->game_baselen) {
 288                                 amaf_op(amaf->map[n->coord], +);
 289                         }
 290                 }
 291         }
 292
 293         assert(n == t->root || n->parent);
 294         if (result != 0) {
 295                 float rval = scale_value(u, b, result);
 296
 297                 u->policy->update(u->policy, t, n, node_color, player_color, amaf, rval);
 298
 299                 if (u->root_heuristic && n->parent) {
 300                         if (!t->chvals) {
 301                                 t->chvals = calloc(board_size2(b), sizeof(t->chvals[0]));
 302                                 t->chchvals = calloc(board_size2(b), sizeof(t->chchvals[0]));
 303                         }
 304
 305                         /* Possibly transform the rval appropriately. */
 306                         rval = stats_temper_value(rval, n->parent->u.value, u->root_heuristic);
 307
 308                         struct tree_node *ni = n;
 309                         while (ni->parent->parent && ni->parent->parent->parent)
 310                                 ni = ni->parent;
 311                         if (ni->parent->parent) {
 312                                 if (likely(!is_pass(ni->coord)))
 313                                         stats_add_result(&t->chchvals[ni->coord], rval, 1);
 314                                 ni = ni->parent;
 315                         }
 316                         assert(ni->parent && !ni->parent->parent);
 317
 318                         if (likely(!is_pass(ni->coord)))
 319                                 stats_add_result(&t->chvals[ni->coord], rval, 1);
 320                 }
 321         }
 322
 323 end:
 324         /* We need to undo the virtual loss we added during descend. */
 325         if (u->virtual_loss) {
 326                 int parity = (node_color == player_color ? 1 : -1);
 327                 for (; n->parent; n = n->parent) {
 328                         stats_rm_result(&n->u, tree_parity(t, parity) > 0 ? 0 : 1, 1);
 329                         parity = -parity;
 330                 }
 331         }
 332
 333         if (dstater) free(dstater);
 334         if (dstate) free(dstate);
 335         if (amaf) {
 336                 free(amaf->map - 1);
 337                 free(amaf);
 338         }
 339         board_done_noalloc(&b2);
 340         return result;
 341 }
 342
 343 int
 344 uct_playouts(struct uct *u, struct board *b, enum stone color, struct tree *t)
 345 {
 346         int i;
 347         for (i = 0; !uct_halt; i++)
 348                 uct_playout(u, b, color, t);
 349         return i;
 350 }