14 #include "uct/internal.h"
18 static struct tree_node
*
19 tree_init_node(struct tree
*t
, coord_t coord
, int depth
)
21 struct tree_node
*n
= calloc(1, sizeof(*n
));
24 static long c
= 1000000;
26 if (depth
> t
->max_depth
)
32 tree_init(struct board
*board
, enum stone color
)
34 struct tree
*t
= calloc(1, sizeof(*t
));
36 /* The root PASS move is only virtual, we never play it. */
37 t
->root
= tree_init_node(t
, pass
, 0);
38 t
->root_symmetry
= board
->symmetry
;
39 t
->root_color
= stone_other(color
); // to research black moves, root will be white
45 tree_done_node(struct tree
*t
, struct tree_node
*n
)
47 struct tree_node
*ni
= n
->children
;
49 struct tree_node
*nj
= ni
->sibling
;
50 tree_done_node(t
, ni
);
57 tree_done(struct tree
*t
)
59 tree_done_node(t
, t
->root
);
65 tree_node_dump(struct tree
*tree
, struct tree_node
*node
, int l
, int thres
)
67 for (int i
= 0; i
< l
; i
++) fputc(' ', stderr
);
69 for (struct tree_node
*ni
= node
->children
; ni
; ni
= ni
->sibling
)
71 /* We use 1 as parity, since for all nodes we want to know the
72 * win probability of _us_, not the node color. */
73 fprintf(stderr
, "[%s] %f (%d/%d playouts [prior %d/%d amaf %d/%d]; hints %x; %d children) <%lld>\n",
74 coord2sstr(node
->coord
, tree
->board
),
75 tree_node_get_value(tree
, node
, u
, 1),
76 tree_node_get_wins(tree
, node
, u
, 1), node
->u
.playouts
,
77 tree_node_get_wins(tree
, node
, prior
, 1), node
->prior
.playouts
,
78 tree_node_get_wins(tree
, node
, amaf
, 1), node
->amaf
.playouts
,
79 node
->hints
, children
, node
->hash
);
81 /* Print nodes sorted by #playouts. */
83 struct tree_node
*nbox
[1000]; int nboxl
= 0;
84 for (struct tree_node
*ni
= node
->children
; ni
; ni
= ni
->sibling
)
85 if (ni
->u
.playouts
> thres
)
90 for (int i
= 0; i
< nboxl
; i
++)
91 if (nbox
[i
] && (best
< 0 || nbox
[i
]->u
.playouts
> nbox
[best
]->u
.playouts
))
95 tree_node_dump(tree
, nbox
[best
], l
+ 1, /* node->u.value < 0.1 ? 0 : */ thres
);
101 tree_dump(struct tree
*tree
, int thres
)
103 if (thres
&& tree
->root
->u
.playouts
/ thres
> 100) {
104 /* Be a bit sensible about this; the opening book can create
105 * huge dumps at first. */
106 thres
= tree
->root
->u
.playouts
/ 100 * (thres
< 1000 ? 1 : thres
/ 1000);
108 tree_node_dump(tree
, tree
->root
, 0, thres
);
113 tree_book_name(struct board
*b
)
115 static char buf
[256];
116 if (b
->handicap
> 0) {
117 sprintf(buf
, "uctbook-%d-%02.01f-h%d.pachitree", b
->size
- 2, b
->komi
, b
->handicap
);
119 sprintf(buf
, "uctbook-%d-%02.01f.pachitree", b
->size
- 2, b
->komi
);
125 tree_node_save(FILE *f
, struct tree_node
*node
, int thres
)
128 fwrite(((void *) node
) + offsetof(struct tree_node
, depth
),
129 sizeof(struct tree_node
) - offsetof(struct tree_node
, depth
),
132 if (node
->u
.playouts
>= thres
)
133 for (struct tree_node
*ni
= node
->children
; ni
; ni
= ni
->sibling
)
134 tree_node_save(f
, ni
, thres
);
140 tree_save(struct tree
*tree
, struct board
*b
, int thres
)
142 char *filename
= tree_book_name(b
);
143 FILE *f
= fopen(filename
, "wb");
148 tree_node_save(f
, tree
->root
, thres
);
155 tree_node_load(FILE *f
, struct tree_node
*node
, int *num
)
159 fread(((void *) node
) + offsetof(struct tree_node
, depth
),
160 sizeof(struct tree_node
) - offsetof(struct tree_node
, depth
),
163 /* Keep values in sane scale, otherwise we start overflowing.
164 * We may go slow here but we must be careful about not getting
165 * too huge integers.*/
166 #define MAX_PLAYOUTS 10000000
167 if (node
->u
.playouts
> MAX_PLAYOUTS
) {
168 int over
= node
->u
.playouts
- MAX_PLAYOUTS
;
169 node
->u
.wins
-= ((double) node
->u
.wins
/ node
->u
.playouts
) * over
;
170 node
->u
.playouts
= MAX_PLAYOUTS
;
172 if (node
->amaf
.playouts
> MAX_PLAYOUTS
) {
173 int over
= node
->amaf
.playouts
- MAX_PLAYOUTS
;
174 node
->amaf
.wins
-= ((double) node
->amaf
.wins
/ node
->amaf
.playouts
) * over
;
175 node
->amaf
.playouts
= MAX_PLAYOUTS
;
178 struct tree_node
*ni
= NULL
, *ni_prev
= NULL
;
180 ni_prev
= ni
; ni
= calloc(1, sizeof(*ni
));
184 ni_prev
->sibling
= ni
;
186 tree_node_load(f
, ni
, num
);
191 tree_load(struct tree
*tree
, struct board
*b
)
193 char *filename
= tree_book_name(b
);
194 FILE *f
= fopen(filename
, "rb");
198 fprintf(stderr
, "Loading opening book %s...\n", filename
);
202 tree_node_load(f
, tree
->root
, &num
);
203 fprintf(stderr
, "Loaded %d nodes.\n", num
);
209 static struct tree_node
*
210 tree_node_copy(struct tree_node
*node
)
212 struct tree_node
*n2
= malloc(sizeof(*n2
));
216 struct tree_node
*ni
= node
->children
;
217 struct tree_node
*ni2
= tree_node_copy(ni
);
218 n2
->children
= ni2
; ni2
->parent
= n2
;
219 while ((ni
= ni
->sibling
)) {
220 ni2
->sibling
= tree_node_copy(ni
);
221 ni2
= ni2
->sibling
; ni2
->parent
= n2
;
227 tree_copy(struct tree
*tree
)
229 struct tree
*t2
= malloc(sizeof(*t2
));
231 t2
->root
= tree_node_copy(tree
->root
);
237 tree_node_merge(struct tree_node
*dest
, struct tree_node
*src
)
239 dest
->hints
|= src
->hints
;
241 /* Merge the children, both are coord-sorted lists. */
242 struct tree_node
*di
= dest
->children
, **dref
= &dest
->children
;
243 struct tree_node
*si
= src
->children
, **sref
= &src
->children
;
245 if (di
->coord
!= si
->coord
) {
246 /* src has some extra items or misses di */
247 struct tree_node
*si2
= si
->sibling
;
248 while (si2
&& di
->coord
!= si2
->coord
) {
252 goto next_di
; /* src misses di, move on */
253 /* chain the extra [si,si2) items before di */
255 while (si
->sibling
!= si2
) {
264 /* Matching nodes - recurse... */
265 tree_node_merge(di
, si
);
266 /* ...and move on. */
267 sref
= &si
->sibling
; si
= si
->sibling
;
269 dref
= &di
->sibling
; di
= di
->sibling
;
272 /* Some outstanding nodes are left on src side, rechain
282 /* Priors should be constant. */
283 assert(dest
->prior
.playouts
== src
->prior
.playouts
&& dest
->prior
.wins
== src
->prior
.wins
);
285 dest
->amaf
.playouts
+= src
->amaf
.playouts
;
286 dest
->amaf
.wins
+= src
->amaf
.wins
;
287 if (dest
->amaf
.playouts
)
288 dest
->amaf
.value
= (float) dest
->amaf
.wins
/ dest
->amaf
.playouts
;
290 dest
->u
.playouts
+= src
->u
.playouts
;
291 dest
->u
.wins
+= src
->u
.wins
;
292 if (dest
->prior
.playouts
+ dest
->amaf
.playouts
+ dest
->u
.playouts
)
293 tree_update_node_value(dest
);
296 /* Merge two trees built upon the same board. Note that the operation is
297 * destructive on src. */
299 tree_merge(struct tree
*dest
, struct tree
*src
)
301 if (src
->max_depth
> dest
->max_depth
)
302 dest
->max_depth
= src
->max_depth
;
303 tree_node_merge(dest
->root
, src
->root
);
308 tree_node_normalize(struct tree_node
*node
, int factor
)
310 for (struct tree_node
*ni
= node
->children
; ni
; ni
= ni
->sibling
)
311 tree_node_normalize(ni
, factor
);
313 #define normalize(s1, s2, t) node->s2.t = node->s1.t + (node->s2.t - node->s1.t) / factor;
314 normalize(pamaf
, amaf
, playouts
);
315 normalize(pamaf
, amaf
, wins
);
316 normalize(pamaf
, amaf
, value
);
317 memcpy(&node
->pamaf
, &node
->amaf
, sizeof(node
->amaf
));
319 normalize(pu
, u
, playouts
);
320 normalize(pu
, u
, wins
);
321 normalize(pu
, u
, value
);
322 memcpy(&node
->pu
, &node
->u
, sizeof(node
->u
));
326 /* Normalize a tree, dividing the amaf and u values by given
327 * factor; otherwise, simulations run in independent threads
328 * two trees built upon the same board. To correctly handle
329 * results taken from previous simulation run, they are backed
332 tree_normalize(struct tree
*tree
, int factor
)
334 tree_node_normalize(tree
->root
, factor
);
338 /* Tree symmetry: When possible, we will localize the tree to a single part
339 * of the board in tree_expand_node() and possibly flip along symmetry axes
340 * to another part of the board in tree_promote_at(). We follow b->symmetry
341 * guidelines here. */
345 tree_expand_node(struct tree
*t
, struct tree_node
*node
, struct board
*b
, enum stone color
, int radar
, struct uct_policy
*policy
, int parity
)
347 struct tree_node
*ni
= tree_init_node(t
, pass
, node
->depth
+ 1);
348 ni
->parent
= node
; node
->children
= ni
;
350 policy
->prior(policy
, t
, ni
, b
, color
, parity
);
352 /* The loop considers only the symmetry playground. */
354 fprintf(stderr
, "expanding %s within [%d,%d],[%d,%d] %d-%d\n",
355 coord2sstr(node
->coord
, b
),
356 b
->symmetry
.x1
, b
->symmetry
.y1
,
357 b
->symmetry
.x2
, b
->symmetry
.y2
,
358 b
->symmetry
.type
, b
->symmetry
.d
);
360 for (int i
= b
->symmetry
.x1
; i
<= b
->symmetry
.x2
; i
++) {
361 for (int j
= b
->symmetry
.y1
; j
<= b
->symmetry
.y2
; j
++) {
363 int x
= b
->symmetry
.type
== SYM_DIAG_DOWN
? board_size(b
) - 1 - i
: i
;
366 fprintf(stderr
, "drop %d,%d\n", i
, j
);
371 coord_t c
= coord_xy_otf(i
, j
, t
->board
);
372 if (board_at(b
, c
) != S_NONE
)
374 assert(c
!= node
->coord
); // I have spotted "C3 C3" in some sequence...
375 /* This looks very useful on large boards - weeds out huge amount of crufty moves. */
376 if (b
->hash
/* not empty board */ && radar
&& !board_stone_radar(b
, c
, radar
))
379 struct tree_node
*nj
= tree_init_node(t
, c
, node
->depth
+ 1);
380 nj
->parent
= node
; ni
->sibling
= nj
; ni
= nj
;
383 policy
->prior(policy
, t
, ni
, b
, color
, parity
);
390 flip_coord(struct board
*b
, coord_t c
,
391 bool flip_horiz
, bool flip_vert
, int flip_diag
)
393 int x
= coord_x(c
, b
), y
= coord_y(c
, b
);
395 int z
= x
; x
= y
; y
= z
;
398 x
= board_size(b
) - 1 - x
;
401 y
= board_size(b
) - 1 - y
;
403 return coord_xy_otf(x
, y
, b
);
407 tree_fix_node_symmetry(struct board
*b
, struct tree_node
*node
,
408 bool flip_horiz
, bool flip_vert
, int flip_diag
)
410 if (!is_pass(node
->coord
))
411 node
->coord
= flip_coord(b
, node
->coord
, flip_horiz
, flip_vert
, flip_diag
);
413 for (struct tree_node
*ni
= node
->children
; ni
; ni
= ni
->sibling
)
414 tree_fix_node_symmetry(b
, ni
, flip_horiz
, flip_vert
, flip_diag
);
418 tree_fix_symmetry(struct tree
*tree
, struct board
*b
, coord_t c
)
423 struct board_symmetry
*s
= &tree
->root_symmetry
;
424 int cx
= coord_x(c
, b
), cy
= coord_y(c
, b
);
426 /* playground X->h->v->d normalization
432 bool flip_horiz
= cx
< s
->x1
|| cx
> s
->x2
;
433 bool flip_vert
= cy
< s
->y1
|| cy
> s
->y2
;
437 bool dir
= (s
->type
== SYM_DIAG_DOWN
);
438 int x
= dir
^ flip_horiz
^ flip_vert
? board_size(b
) - 1 - cx
: cx
;
439 if (flip_vert
? x
< cy
: x
> cy
) {
445 fprintf(stderr
, "%s will flip %d %d %d -> %s, sym %d (%d) -> %d (%d)\n",
446 coord2sstr(c
, b
), flip_horiz
, flip_vert
, flip_diag
,
447 coord2sstr(flip_coord(b
, c
, flip_horiz
, flip_vert
, flip_diag
), b
),
448 s
->type
, s
->d
, b
->symmetry
.type
, b
->symmetry
.d
);
450 if (flip_horiz
|| flip_vert
|| flip_diag
)
451 tree_fix_node_symmetry(b
, tree
->root
, flip_horiz
, flip_vert
, flip_diag
);
456 tree_unlink_node(struct tree_node
*node
)
458 struct tree_node
*ni
= node
->parent
;
459 if (ni
->children
== node
) {
460 ni
->children
= node
->sibling
;
463 while (ni
->sibling
!= node
)
465 ni
->sibling
= node
->sibling
;
467 node
->sibling
= NULL
;
472 tree_delete_node(struct tree
*tree
, struct tree_node
*node
)
474 tree_unlink_node(node
);
475 tree_done_node(tree
, node
);
479 tree_promote_node(struct tree
*tree
, struct tree_node
*node
)
481 assert(node
->parent
== tree
->root
);
482 tree_unlink_node(node
);
483 tree_done_node(tree
, tree
->root
);
485 tree
->root_color
= stone_other(tree
->root_color
);
486 board_symmetry_update(tree
->board
, &tree
->root_symmetry
, node
->coord
);
490 tree_promote_at(struct tree
*tree
, struct board
*b
, coord_t c
)
492 tree_fix_symmetry(tree
, b
, c
);
494 for (struct tree_node
*ni
= tree
->root
->children
; ni
; ni
= ni
->sibling
) {
495 if (ni
->coord
== c
) {
496 tree_promote_node(tree
, ni
);
504 tree_leaf_node(struct tree_node
*node
)
506 return !(node
->children
);
510 tree_update_node_value(struct tree_node
*node
)
512 bool noamaf
= node
->hints
& NODE_HINT_NOAMAF
;
513 node
->u
.value
= (float)(node
->u
.wins
+ node
->prior
.wins
+ (!noamaf
? node
->amaf
.wins
: 0))
514 / (node
->u
.playouts
+ node
->prior
.playouts
+ (!noamaf
? node
->amaf
.playouts
: 0));
516 { struct board b2
; board_size(&b2
) = 9+2;
517 fprintf(stderr
, "%s->%s %d/%d %d/%d %f\n", node
->parent
? coord2sstr(node
->parent
->coord
, &b2
) : NULL
, coord2sstr(node
->coord
, &b2
), node
->u
.wins
, node
->u
.playouts
, node
->prior
.wins
, node
->prior
.playouts
, node
->u
.value
); }