15 #include "joseki/base.h"
17 #include "playout/elo.h"
18 #include "playout/moggy.h"
19 #include "playout/light.h"
22 #include "uct/dynkomi.h"
23 #include "uct/internal.h"
24 #include "uct/plugins.h"
25 #include "uct/prior.h"
26 #include "uct/search.h"
27 #include "uct/slave.h"
32 struct uct_policy
*policy_ucb1_init(struct uct
*u
, char *arg
);
33 struct uct_policy
*policy_ucb1amaf_init(struct uct
*u
, char *arg
);
34 static void uct_pondering_start(struct uct
*u
, struct board
*b0
, struct tree
*t
, enum stone color
);
36 /* Maximal simulation length. */
37 #define MC_GAMELEN MAX_GAMELEN
41 setup_state(struct uct
*u
, struct board
*b
, enum stone color
)
43 u
->t
= tree_init(b
, color
, u
->fast_alloc
? u
->max_tree_size
: 0,
44 u
->local_tree_aging
, u
->stats_hbits
);
46 fast_srandom(u
->force_seed
);
48 fprintf(stderr
, "Fresh board with random seed %lu\n", fast_getseed());
49 //board_print(b, stderr);
50 if (!u
->no_book
&& b
->moves
== 0) {
51 assert(color
== S_BLACK
);
57 reset_state(struct uct
*u
)
60 tree_done(u
->t
); u
->t
= NULL
;
64 setup_dynkomi(struct uct
*u
, struct board
*b
, enum stone to_play
)
66 if (u
->t
->use_extra_komi
&& !u
->pondering
&& u
->dynkomi
->permove
)
67 u
->t
->extra_komi
= u
->dynkomi
->permove(u
->dynkomi
, b
, u
->t
);
68 else if (!u
->t
->use_extra_komi
)
73 uct_prepare_move(struct uct
*u
, struct board
*b
, enum stone color
)
76 /* Verify that we have sane state. */
78 assert(u
->t
&& b
->moves
);
79 if (color
!= stone_other(u
->t
->root_color
)) {
80 fprintf(stderr
, "Fatal: Non-alternating play detected %d %d\n",
81 color
, u
->t
->root_color
);
84 uct_htable_reset(u
->t
);
87 /* We need fresh state. */
89 setup_state(u
, b
, color
);
92 u
->ownermap
.playouts
= 0;
93 memset(u
->ownermap
.map
, 0, board_size2(b
) * sizeof(u
->ownermap
.map
[0]));
94 u
->played_own
= u
->played_all
= 0;
98 dead_group_list(struct uct
*u
, struct board
*b
, struct move_queue
*mq
)
100 struct group_judgement gj
;
102 gj
.gs
= alloca(board_size2(b
) * sizeof(gj
.gs
[0]));
103 board_ownermap_judge_group(b
, &u
->ownermap
, &gj
);
104 groups_of_status(b
, &gj
, GS_DEAD
, mq
);
108 uct_pass_is_safe(struct uct
*u
, struct board
*b
, enum stone color
, bool pass_all_alive
)
110 if (u
->ownermap
.playouts
< GJ_MINGAMES
)
113 struct move_queue mq
= { .moves
= 0 };
114 dead_group_list(u
, b
, &mq
);
115 if (pass_all_alive
&& mq
.moves
> 0)
116 return false; // We need to remove some dead groups first.
117 return pass_is_safe(b
, color
, &mq
);
121 uct_printhook_ownermap(struct board
*board
, coord_t c
, char *s
, char *end
)
123 struct uct
*u
= board
->es
;
125 const char chr
[] = ":XO,"; // dame, black, white, unclear
126 const char chm
[] = ":xo,";
127 char ch
= chr
[board_ownermap_judge_point(&u
->ownermap
, c
, GJ_THRES
)];
128 if (ch
== ',') { // less precise estimate then?
129 ch
= chm
[board_ownermap_judge_point(&u
->ownermap
, c
, 0.67)];
131 s
+= snprintf(s
, end
- s
, "%c ", ch
);
136 uct_notify_play(struct engine
*e
, struct board
*b
, struct move
*m
)
138 struct uct
*u
= e
->data
;
140 /* No state, create one - this is probably game beginning
141 * and we need to load the opening book right now. */
142 uct_prepare_move(u
, b
, m
->color
);
146 /* Stop pondering, required by tree_promote_at() */
147 uct_pondering_stop(u
);
148 if (UDEBUGL(2) && u
->slave
)
149 tree_dump(u
->t
, u
->dumpthres
);
151 if (is_resign(m
->coord
)) {
157 /* Promote node of the appropriate move to the tree root. */
159 if (!tree_promote_at(u
->t
, b
, m
->coord
)) {
161 fprintf(stderr
, "Warning: Cannot promote move node! Several play commands in row?\n");
166 /* If we are a slave in a distributed engine, start pondering once
167 * we know which move we actually played. See uct_genmove() about
168 * the check for pass. */
169 if (u
->pondering_opt
&& u
->slave
&& m
->color
== u
->my_color
&& !is_pass(m
->coord
))
170 uct_pondering_start(u
, b
, u
->t
, stone_other(m
->color
));
176 uct_result(struct engine
*e
, struct board
*b
)
178 struct uct
*u
= e
->data
;
179 static char reply
[1024];
183 enum stone color
= u
->t
->root_color
;
184 struct tree_node
*n
= u
->t
->root
;
185 snprintf(reply
, 1024, "%s %s %d %.2f %.1f",
186 stone2str(color
), coord2sstr(n
->coord
, b
),
187 n
->u
.playouts
, tree_node_get_value(u
->t
, -1, n
->u
.value
),
188 u
->t
->use_extra_komi
? u
->t
->extra_komi
: 0);
193 uct_chat(struct engine
*e
, struct board
*b
, char *cmd
)
195 struct uct
*u
= e
->data
;
196 static char reply
[1024];
198 cmd
+= strspn(cmd
, " \n\t");
199 if (!strncasecmp(cmd
, "winrate", 7)) {
201 return "no game context (yet?)";
202 enum stone color
= u
->t
->root_color
;
203 struct tree_node
*n
= u
->t
->root
;
204 snprintf(reply
, 1024, "In %d playouts at %d threads, %s %s can win with %.2f%% probability",
205 n
->u
.playouts
, u
->threads
, stone2str(color
), coord2sstr(n
->coord
, b
),
206 tree_node_get_value(u
->t
, -1, n
->u
.value
) * 100);
207 if (u
->t
->use_extra_komi
&& abs(u
->t
->extra_komi
) >= 0.5) {
208 sprintf(reply
+ strlen(reply
), ", while self-imposing extra komi %.1f",
218 uct_dead_group_list(struct engine
*e
, struct board
*b
, struct move_queue
*mq
)
220 struct uct
*u
= e
->data
;
222 /* This means the game is probably over, no use pondering on. */
223 uct_pondering_stop(u
);
225 if (u
->pass_all_alive
)
226 return; // no dead groups
228 bool mock_state
= false;
231 /* No state, but we cannot just back out - we might
232 * have passed earlier, only assuming some stones are
233 * dead, and then re-connected, only to lose counting
234 * when all stones are assumed alive. */
235 uct_prepare_move(u
, b
, S_BLACK
); assert(u
->t
);
238 /* Make sure the ownermap is well-seeded. */
239 while (u
->ownermap
.playouts
< GJ_MINGAMES
)
240 uct_playout(u
, b
, S_BLACK
, u
->t
);
241 /* Show the ownermap: */
243 board_print_custom(b
, stderr
, uct_printhook_ownermap
);
245 dead_group_list(u
, b
, mq
);
248 /* Clean up the mock state in case we will receive
249 * a genmove; we could get a non-alternating-move
250 * error from uct_prepare_move() in that case otherwise. */
256 playout_policy_done(struct playout_policy
*p
)
258 if (p
->done
) p
->done(p
);
259 if (p
->data
) free(p
->data
);
264 uct_done(struct engine
*e
)
266 /* This is called on engine reset, especially when clear_board
267 * is received and new game should begin. */
268 struct uct
*u
= e
->data
;
269 uct_pondering_stop(u
);
270 if (u
->t
) reset_state(u
);
271 free(u
->ownermap
.map
);
274 free(u
->random_policy
);
275 playout_policy_done(u
->playout
);
276 uct_prior_done(u
->prior
);
277 joseki_done(u
->jdict
);
278 pluginset_done(u
->plugins
);
283 /* Run time-limited MCTS search on foreground. */
285 uct_search(struct uct
*u
, struct board
*b
, struct time_info
*ti
, enum stone color
, struct tree
*t
)
287 struct uct_search_state s
;
288 uct_search_start(u
, b
, color
, t
, ti
, &s
);
289 if (UDEBUGL(2) && s
.base_playouts
> 0)
290 fprintf(stderr
, "<pre-simulated %d games>\n", s
.base_playouts
);
292 /* The search tree is ctx->t. This is currently == . It is important
293 * to reference ctx->t directly since the
294 * thread manager will swap the tree pointer asynchronously. */
296 /* Now, just periodically poll the search tree. */
298 time_sleep(TREE_BUSYWAIT_INTERVAL
);
299 /* TREE_BUSYWAIT_INTERVAL should never be less than desired time, or the
300 * time control is broken. But if it happens to be less, we still search
301 * at least 100ms otherwise the move is completely random. */
303 int i
= uct_search_games(&s
);
304 /* Print notifications etc. */
305 uct_search_progress(u
, b
, color
, t
, ti
, &s
, i
);
306 /* Check if we should stop the search. */
307 if (uct_search_check_stop(u
, b
, color
, t
, ti
, &s
, i
))
311 struct uct_thread_ctx
*ctx
= uct_search_stop();
312 if (UDEBUGL(2)) tree_dump(t
, u
->dumpthres
);
314 fprintf(stderr
, "(avg score %f/%d value %f/%d)\n",
315 u
->dynkomi
->score
.value
, u
->dynkomi
->score
.playouts
,
316 u
->dynkomi
->value
.value
, u
->dynkomi
->value
.playouts
);
318 uct_progress_status(u
, t
, color
, ctx
->games
);
320 u
->played_own
+= ctx
->games
;
324 /* Start pondering background with @color to play. */
326 uct_pondering_start(struct uct
*u
, struct board
*b0
, struct tree
*t
, enum stone color
)
329 fprintf(stderr
, "Starting to ponder with color %s\n", stone2str(stone_other(color
)));
332 /* We need a local board copy to ponder upon. */
333 struct board
*b
= malloc2(sizeof(*b
)); board_copy(b
, b0
);
335 /* *b0 did not have the genmove'd move played yet. */
336 struct move m
= { t
->root
->coord
, t
->root_color
};
337 int res
= board_play(b
, &m
);
339 setup_dynkomi(u
, b
, stone_other(m
.color
));
341 /* Start MCTS manager thread "headless". */
342 static struct uct_search_state s
;
343 uct_search_start(u
, b
, color
, t
, NULL
, &s
);
346 /* uct_search_stop() frontend for the pondering (non-genmove) mode, and
347 * to stop the background search for a slave in the distributed engine. */
349 uct_pondering_stop(struct uct
*u
)
351 if (!thread_manager_running
)
354 /* Stop the thread manager. */
355 struct uct_thread_ctx
*ctx
= uct_search_stop();
357 if (u
->pondering
) fprintf(stderr
, "(pondering) ");
358 uct_progress_status(u
, ctx
->t
, ctx
->color
, ctx
->games
);
362 u
->pondering
= false;
368 uct_genmove_setup(struct uct
*u
, struct board
*b
, enum stone color
)
370 if (b
->superko_violation
) {
371 fprintf(stderr
, "!!! WARNING: SUPERKO VIOLATION OCCURED BEFORE THIS MOVE\n");
372 fprintf(stderr
, "Maybe you play with situational instead of positional superko?\n");
373 fprintf(stderr
, "I'm going to ignore the violation, but note that I may miss\n");
374 fprintf(stderr
, "some moves valid under this ruleset because of this.\n");
375 b
->superko_violation
= false;
378 uct_prepare_move(u
, b
, color
);
383 /* How to decide whether to use dynkomi in this game? Since we use
384 * pondering, it's not simple "who-to-play" matter. Decide based on
385 * the last genmove issued. */
386 u
->t
->use_extra_komi
= !!(u
->dynkomi_mask
& color
);
387 /* Moreover, we do not use extra komi at the game end - we are not
388 * to fool ourselves at this point. */
389 if (board_estimated_moves_left(b
) <= MIN_MOVES_LEFT
)
390 u
->t
->use_extra_komi
= false;
391 setup_dynkomi(u
, b
, color
);
393 if (b
->rules
== RULES_JAPANESE
)
394 u
->territory_scoring
= true;
396 /* Make pessimistic assumption about komi for Japanese rules to
397 * avoid losing by 0.5 when winning by 0.5 with Chinese rules.
398 * The rules usually give the same winner if the integer part of komi
399 * is odd so we adjust the komi only if it is even (for a board of
400 * odd size). We are not trying to get an exact evaluation for rare
401 * cases of seki. For details see http://home.snafu.de/jasiek/parity.html */
402 if (u
->territory_scoring
&& (((int)floor(b
->komi
) + board_size(b
)) & 1)) {
403 b
->komi
+= (color
== S_BLACK
? 1.0 : -1.0);
405 fprintf(stderr
, "Setting komi to %.1f assuming Japanese rules\n",
411 uct_genmove(struct engine
*e
, struct board
*b
, struct time_info
*ti
, enum stone color
, bool pass_all_alive
)
413 double start_time
= time_now();
414 struct uct
*u
= e
->data
;
415 uct_pondering_stop(u
);
416 uct_genmove_setup(u
, b
, color
);
418 /* Start the Monte Carlo Tree Search! */
419 int base_playouts
= u
->t
->root
->u
.playouts
;
420 int played_games
= uct_search(u
, b
, ti
, color
, u
->t
);
423 struct tree_node
*best
;
424 best
= uct_search_result(u
, b
, color
, pass_all_alive
, played_games
, base_playouts
, &best_coord
);
427 double time
= time_now() - start_time
+ 0.000001; /* avoid divide by zero */
428 fprintf(stderr
, "genmove in %0.2fs (%d games/s, %d games/s/thread)\n",
429 time
, (int)(played_games
/time
), (int)(played_games
/time
/u
->threads
));
433 /* Pass or resign. */
435 return coord_copy(best_coord
);
437 tree_promote_node(u
->t
, &best
);
439 /* After a pass, pondering is harmful for two reasons:
440 * (i) We might keep pondering even when the game is over.
441 * Of course this is the case for opponent resign as well.
442 * (ii) More importantly, the ownermap will get skewed since
443 * the UCT will start cutting off any playouts. */
444 if (u
->pondering_opt
&& !is_pass(best
->coord
)) {
445 uct_pondering_start(u
, b
, u
->t
, stone_other(color
));
447 return coord_copy(best_coord
);
452 uct_genbook(struct engine
*e
, struct board
*b
, struct time_info
*ti
, enum stone color
)
454 struct uct
*u
= e
->data
;
455 if (!u
->t
) uct_prepare_move(u
, b
, color
);
458 if (ti
->dim
== TD_GAMES
) {
459 /* Don't count in games that already went into the book. */
460 ti
->len
.games
+= u
->t
->root
->u
.playouts
;
462 uct_search(u
, b
, ti
, color
, u
->t
);
464 assert(ti
->dim
== TD_GAMES
);
465 tree_save(u
->t
, b
, ti
->len
.games
/ 100);
471 uct_dumpbook(struct engine
*e
, struct board
*b
, enum stone color
)
473 struct uct
*u
= e
->data
;
474 struct tree
*t
= tree_init(b
, color
, u
->fast_alloc
? u
->max_tree_size
: 0, u
->local_tree_aging
, 0);
482 uct_state_init(char *arg
, struct board
*b
)
484 struct uct
*u
= calloc2(1, sizeof(struct uct
));
485 bool using_elo
= false;
487 u
->debug_level
= debug_level
;
488 u
->gamelen
= MC_GAMELEN
;
492 u
->playout_amaf
= true;
493 u
->playout_amaf_nakade
= false;
494 u
->amaf_prior
= false;
495 u
->max_tree_size
= 3072ULL * 1048576;
498 u
->thread_model
= TM_TREEVL
;
499 u
->virtual_loss
= true;
501 u
->fuseki_end
= 20; // max time at 361*20% = 72 moves (our 36th move, still 99 to play)
502 u
->yose_start
= 40; // (100-40-25)*361/100/2 = 63 moves still to play by us then
503 u
->bestr_ratio
= 0.02;
504 // 2.5 is clearly too much, but seems to compensate well for overly stern time allocations.
505 // TODO: Further tuning and experiments with better time allocation schemes.
506 u
->best2_ratio
= 2.5;
508 u
->val_scale
= 0.04; u
->val_points
= 40;
509 u
->dynkomi_interval
= 1000;
510 u
->dynkomi_mask
= S_BLACK
| S_WHITE
;
513 u
->local_tree_aging
= 2;
515 u
->plugins
= pluginset_init(b
);
517 u
->jdict
= joseki_load(b
->size
);
520 char *optspec
, *next
= arg
;
523 next
+= strcspn(next
, ",");
524 if (*next
) { *next
++ = 0; } else { *next
= 0; }
526 char *optname
= optspec
;
527 char *optval
= strchr(optspec
, '=');
528 if (optval
) *optval
++ = 0;
530 if (!strcasecmp(optname
, "debug")) {
532 u
->debug_level
= atoi(optval
);
535 } else if (!strcasecmp(optname
, "mercy") && optval
) {
536 /* Minimal difference of black/white captures
537 * to stop playout - "Mercy Rule". Speeds up
538 * hopeless playouts at the expense of some
540 u
->mercymin
= atoi(optval
);
541 } else if (!strcasecmp(optname
, "gamelen") && optval
) {
542 u
->gamelen
= atoi(optval
);
543 } else if (!strcasecmp(optname
, "expand_p") && optval
) {
544 u
->expand_p
= atoi(optval
);
545 } else if (!strcasecmp(optname
, "dumpthres") && optval
) {
546 u
->dumpthres
= atoi(optval
);
547 } else if (!strcasecmp(optname
, "best2_ratio") && optval
) {
548 /* If set, prolong simulating while
549 * first_best/second_best playouts ratio
550 * is less than best2_ratio. */
551 u
->best2_ratio
= atof(optval
);
552 } else if (!strcasecmp(optname
, "bestr_ratio") && optval
) {
553 /* If set, prolong simulating while
554 * best,best_best_child values delta
555 * is more than bestr_ratio. */
556 u
->bestr_ratio
= atof(optval
);
557 } else if (!strcasecmp(optname
, "playout_amaf")) {
558 /* Whether to include random playout moves in
559 * AMAF as well. (Otherwise, only tree moves
560 * are included in AMAF. Of course makes sense
561 * only in connection with an AMAF policy.) */
562 /* with-without: 55.5% (+-4.1) */
563 if (optval
&& *optval
== '0')
564 u
->playout_amaf
= false;
566 u
->playout_amaf
= true;
567 } else if (!strcasecmp(optname
, "playout_amaf_nakade")) {
568 /* Whether to include nakade moves from playouts
569 * in the AMAF statistics; this tends to nullify
570 * the playout_amaf effect by adding too much
572 if (optval
&& *optval
== '0')
573 u
->playout_amaf_nakade
= false;
575 u
->playout_amaf_nakade
= true;
576 } else if (!strcasecmp(optname
, "playout_amaf_cutoff") && optval
) {
577 /* Keep only first N% of playout stage AMAF
579 u
->playout_amaf_cutoff
= atoi(optval
);
580 } else if ((!strcasecmp(optname
, "policy") || !strcasecmp(optname
, "random_policy")) && optval
) {
581 char *policyarg
= strchr(optval
, ':');
582 struct uct_policy
**p
= !strcasecmp(optname
, "policy") ? &u
->policy
: &u
->random_policy
;
585 if (!strcasecmp(optval
, "ucb1")) {
586 *p
= policy_ucb1_init(u
, policyarg
);
587 } else if (!strcasecmp(optval
, "ucb1amaf")) {
588 *p
= policy_ucb1amaf_init(u
, policyarg
);
590 fprintf(stderr
, "UCT: Invalid tree policy %s\n", optval
);
593 } else if (!strcasecmp(optname
, "playout") && optval
) {
594 char *playoutarg
= strchr(optval
, ':');
597 if (!strcasecmp(optval
, "moggy")) {
598 u
->playout
= playout_moggy_init(playoutarg
, b
, u
->jdict
);
599 } else if (!strcasecmp(optval
, "light")) {
600 u
->playout
= playout_light_init(playoutarg
, b
);
601 } else if (!strcasecmp(optval
, "elo")) {
602 u
->playout
= playout_elo_init(playoutarg
, b
);
605 fprintf(stderr
, "UCT: Invalid playout policy %s\n", optval
);
608 } else if (!strcasecmp(optname
, "prior") && optval
) {
609 u
->prior
= uct_prior_init(optval
, b
);
610 } else if (!strcasecmp(optname
, "amaf_prior") && optval
) {
611 u
->amaf_prior
= atoi(optval
);
612 } else if (!strcasecmp(optname
, "threads") && optval
) {
613 /* By default, Pachi will run with only single
614 * tree search thread! */
615 u
->threads
= atoi(optval
);
616 } else if (!strcasecmp(optname
, "thread_model") && optval
) {
617 if (!strcasecmp(optval
, "tree")) {
618 /* Tree parallelization - all threads
619 * grind on the same tree. */
620 u
->thread_model
= TM_TREE
;
621 u
->virtual_loss
= false;
622 } else if (!strcasecmp(optval
, "treevl")) {
623 /* Tree parallelization, but also
624 * with virtual losses - this discou-
625 * rages most threads choosing the
626 * same tree branches to read. */
627 u
->thread_model
= TM_TREEVL
;
628 u
->virtual_loss
= true;
630 fprintf(stderr
, "UCT: Invalid thread model %s\n", optval
);
633 } else if (!strcasecmp(optname
, "pondering")) {
634 /* Keep searching even during opponent's turn. */
635 u
->pondering_opt
= !optval
|| atoi(optval
);
636 } else if (!strcasecmp(optname
, "fuseki_end") && optval
) {
637 /* At the very beginning it's not worth thinking
638 * too long because the playout evaluations are
639 * very noisy. So gradually increase the thinking
640 * time up to maximum when fuseki_end percent
641 * of the board has been played.
642 * This only applies if we are not in byoyomi. */
643 u
->fuseki_end
= atoi(optval
);
644 } else if (!strcasecmp(optname
, "yose_start") && optval
) {
645 /* When yose_start percent of the board has been
646 * played, or if we are in byoyomi, stop spending
647 * more time and spread the remaining time
649 * Between fuseki_end and yose_start, we spend
650 * a constant proportion of the remaining time
651 * on each move. (yose_start should actually
652 * be much earlier than when real yose start,
653 * but "yose" is a good short name to convey
655 u
->yose_start
= atoi(optval
);
656 } else if (!strcasecmp(optname
, "force_seed") && optval
) {
657 u
->force_seed
= atoi(optval
);
658 } else if (!strcasecmp(optname
, "no_book")) {
660 } else if (!strcasecmp(optname
, "dynkomi") && optval
) {
661 /* Dynamic komi approach; there are multiple
662 * ways to adjust komi dynamically throughout
663 * play. We currently support two: */
664 char *dynkomiarg
= strchr(optval
, ':');
667 if (!strcasecmp(optval
, "none")) {
668 u
->dynkomi
= uct_dynkomi_init_none(u
, dynkomiarg
, b
);
669 } else if (!strcasecmp(optval
, "linear")) {
670 /* You should set dynkomi_mask=1
671 * since this doesn't work well
672 * for white handicaps! */
673 u
->dynkomi
= uct_dynkomi_init_linear(u
, dynkomiarg
, b
);
674 } else if (!strcasecmp(optval
, "adaptive")) {
675 /* There are many more knobs to
676 * crank - see uct/dynkomi.c. */
677 u
->dynkomi
= uct_dynkomi_init_adaptive(u
, dynkomiarg
, b
);
679 fprintf(stderr
, "UCT: Invalid dynkomi mode %s\n", optval
);
682 } else if (!strcasecmp(optname
, "dynkomi_mask") && optval
) {
683 /* Bitmask of colors the player must be
684 * for dynkomi be applied; you may want
685 * to use dynkomi_mask=3 to allow dynkomi
686 * even in games where Pachi is white. */
687 u
->dynkomi_mask
= atoi(optval
);
688 } else if (!strcasecmp(optname
, "dynkomi_interval") && optval
) {
689 /* If non-zero, re-adjust dynamic komi
690 * throughout a single genmove reading,
691 * roughly every N simulations. */
692 /* XXX: Does not work with tree
693 * parallelization. */
694 u
->dynkomi_interval
= atoi(optval
);
695 } else if (!strcasecmp(optname
, "val_scale") && optval
) {
696 /* How much of the game result value should be
697 * influenced by win size. Zero means it isn't. */
698 u
->val_scale
= atof(optval
);
699 } else if (!strcasecmp(optname
, "val_points") && optval
) {
700 /* Maximum size of win to be scaled into game
701 * result value. Zero means boardsize^2. */
702 u
->val_points
= atoi(optval
) * 2; // result values are doubled
703 } else if (!strcasecmp(optname
, "val_extra")) {
704 /* If false, the score coefficient will be simply
705 * added to the value, instead of scaling the result
706 * coefficient because of it. */
707 u
->val_extra
= !optval
|| atoi(optval
);
708 } else if (!strcasecmp(optname
, "local_tree") && optval
) {
709 /* Whether to bias exploration by local tree values
710 * (must be supported by the used policy).
712 * 1: Do, value = result.
713 * Try to temper the result:
714 * 2: Do, value = 0.5+(result-expected)/2.
715 * 3: Do, value = 0.5+bzz((result-expected)^2).
716 * 4: Do, value = 0.5+sqrt(result-expected)/2. */
717 u
->local_tree
= atoi(optval
);
718 } else if (!strcasecmp(optname
, "tenuki_d") && optval
) {
719 /* Tenuki distance at which to break the local tree. */
720 u
->tenuki_d
= atoi(optval
);
721 if (u
->tenuki_d
> TREE_NODE_D_MAX
+ 1) {
722 fprintf(stderr
, "uct: tenuki_d must not be larger than TREE_NODE_D_MAX+1 %d\n", TREE_NODE_D_MAX
+ 1);
725 } else if (!strcasecmp(optname
, "local_tree_aging") && optval
) {
726 /* How much to reduce local tree values between moves. */
727 u
->local_tree_aging
= atof(optval
);
728 } else if (!strcasecmp(optname
, "local_tree_allseq")) {
729 /* By default, only complete sequences are stored
730 * in the local tree. If this is on, also
731 * subsequences starting at each move are stored. */
732 u
->local_tree_allseq
= !optval
|| atoi(optval
);
733 } else if (!strcasecmp(optname
, "local_tree_playout")) {
734 /* Whether to adjust ELO playout probability
735 * distributions according to matched localtree
737 u
->local_tree_playout
= !optval
|| atoi(optval
);
738 } else if (!strcasecmp(optname
, "local_tree_pseqroot")) {
739 /* By default, when we have no sequence move
740 * to suggest in-playout, we give up. If this
741 * is on, we make probability distribution from
742 * sequences first moves instead. */
743 u
->local_tree_pseqroot
= !optval
|| atoi(optval
);
744 } else if (!strcasecmp(optname
, "pass_all_alive")) {
745 /* Whether to consider passing only after all
746 * dead groups were removed from the board;
747 * this is like all genmoves are in fact
748 * kgs-genmove_cleanup. */
749 u
->pass_all_alive
= !optval
|| atoi(optval
);
750 } else if (!strcasecmp(optname
, "territory_scoring")) {
751 /* Use territory scoring (default is area scoring).
752 * An explicit kgs-rules command overrides this. */
753 u
->territory_scoring
= !optval
|| atoi(optval
);
754 } else if (!strcasecmp(optname
, "random_policy_chance") && optval
) {
755 /* If specified (N), with probability 1/N, random_policy policy
756 * descend is used instead of main policy descend; useful
757 * if specified policy (e.g. UCB1AMAF) can make unduly biased
758 * choices sometimes, you can fall back to e.g.
759 * random_policy=UCB1. */
760 u
->random_policy_chance
= atoi(optval
);
761 } else if (!strcasecmp(optname
, "max_tree_size") && optval
) {
762 /* Maximum amount of memory [MiB] consumed by the move tree.
763 * For fast_alloc it includes the temp tree used for pruning.
764 * Default is 3072 (3 GiB). */
765 u
->max_tree_size
= atol(optval
) * 1048576;
766 } else if (!strcasecmp(optname
, "fast_alloc")) {
767 u
->fast_alloc
= !optval
|| atoi(optval
);
768 } else if (!strcasecmp(optname
, "slave")) {
769 /* Act as slave for the distributed engine. */
770 u
->slave
= !optval
|| atoi(optval
);
771 } else if (!strcasecmp(optname
, "shared_nodes") && optval
) {
772 /* Share at most shared_nodes between master and slave at each genmoves.
773 * Must use the same value in master and slaves. */
774 u
->shared_nodes
= atoi(optval
);
775 } else if (!strcasecmp(optname
, "shared_levels") && optval
) {
776 /* Share only nodes of level <= shared_levels. */
777 u
->shared_levels
= atoi(optval
);
778 } else if (!strcasecmp(optname
, "stats_hbits") && optval
) {
779 /* Set hash table size to 2^stats_hbits for the shared stats. */
780 u
->stats_hbits
= atoi(optval
);
781 } else if (!strcasecmp(optname
, "banner") && optval
) {
782 /* Additional banner string. This must come as the
783 * last engine parameter. */
784 if (*next
) *--next
= ',';
785 u
->banner
= strdup(optval
);
787 } else if (!strcasecmp(optname
, "plugin") && optval
) {
788 /* Load an external plugin; filename goes before the colon,
789 * extra arguments after the colon. */
790 char *pluginarg
= strchr(optval
, ':');
793 plugin_load(u
->plugins
, optval
, pluginarg
);
795 fprintf(stderr
, "uct: Invalid engine argument %s or missing value\n", optname
);
801 u
->resign_ratio
= 0.2; /* Resign when most games are lost. */
802 u
->loss_threshold
= 0.85; /* Stop reading if after at least 2000 playouts this is best value. */
804 u
->policy
= policy_ucb1amaf_init(u
, NULL
);
806 if (!!u
->random_policy_chance
^ !!u
->random_policy
) {
807 fprintf(stderr
, "uct: Only one of random_policy and random_policy_chance is set\n");
811 if (!u
->local_tree
) {
812 /* No ltree aging. */
813 u
->local_tree_aging
= 1.0f
;
816 u
->local_tree_playout
= false;
819 u
->max_tree_size
= (100ULL * u
->max_tree_size
) / (100 + MIN_FREE_MEM_PERCENT
);
822 u
->prior
= uct_prior_init(NULL
, b
);
825 u
->playout
= playout_moggy_init(NULL
, b
, u
->jdict
);
826 u
->playout
->debug_level
= u
->debug_level
;
828 u
->ownermap
.map
= malloc2(board_size2(b
) * sizeof(u
->ownermap
.map
[0]));
831 if (!u
->stats_hbits
) u
->stats_hbits
= DEFAULT_STATS_HBITS
;
832 if (!u
->shared_nodes
) u
->shared_nodes
= DEFAULT_SHARED_NODES
;
833 if (!u
->shared_levels
) u
->shared_levels
= 1;
834 assert(u
->shared_levels
* board_bits2(b
) <= 8 * (int)sizeof(path_t
));
838 u
->dynkomi
= uct_dynkomi_init_adaptive(u
, NULL
, b
);
840 /* Some things remain uninitialized for now - the opening book
841 * is not loaded and the tree not set up. */
842 /* This will be initialized in setup_state() at the first move
843 * received/requested. This is because right now we are not aware
844 * about any komi or handicap setup and such. */
850 engine_uct_init(char *arg
, struct board
*b
)
852 struct uct
*u
= uct_state_init(arg
, b
);
853 struct engine
*e
= calloc2(1, sizeof(struct engine
));
854 e
->name
= "UCT Engine";
855 e
->printhook
= uct_printhook_ownermap
;
856 e
->notify_play
= uct_notify_play
;
858 e
->result
= uct_result
;
859 e
->genmove
= uct_genmove
;
860 e
->genmoves
= uct_genmoves
;
861 e
->dead_group_list
= uct_dead_group_list
;
865 e
->notify
= uct_notify
;
867 const char banner
[] = "I'm playing UCT. When I'm losing, I will resign, "
868 "if I think I win, I play until you pass. "
869 "Anyone can send me 'winrate' in private chat to get my assessment of the position.";
870 if (!u
->banner
) u
->banner
= "";
871 e
->comment
= malloc2(sizeof(banner
) + strlen(u
->banner
) + 1);
872 sprintf(e
->comment
, "%s %s", banner
, u
->banner
);