12 play_random_game(struct board
*b
, enum stone starting_color
, int gamelen
,
13 struct playout_amafmap
*amafmap
,
14 struct playout_policy
*policy
)
16 gamelen
= gamelen
- b
->moves
;
20 enum stone color
= starting_color
;
21 enum stone policy_color
= stone_other(starting_color
);
25 amafmap
->color
= color
;
27 int passes
= is_pass(b
->last_move
.coord
);
29 while (gamelen
-- && passes
< 2) {
30 urgent
= policy
->choose(policy
, b
, policy_color
);
34 if (!is_pass(urgent
)) {
36 m
.coord
= urgent
; m
.color
= color
;
37 if (board_play(b
, &m
) < 0) {
39 fprintf(stderr
, "Urgent move %d,%d is ILLEGAL:\n", coord_x(urgent
, b
), coord_y(urgent
, b
));
40 board_print(b
, stderr
);
47 board_play_random(b
, color
, &coord
);
51 /* For UCT, superko test here is downright harmful since
52 * in superko-likely situation we throw away literarily
53 * 95% of our playouts; UCT will deal with this fine by
55 if (unlikely(b
->superko_violation
)) {
56 /* We ignore superko violations that are suicides. These
57 * are common only at the end of the game and are
58 * rather harmless. (They will not go through as a root
60 if (group_at(b
, coord
)) {
62 fprintf(stderr
, "Superko fun at %d,%d in\n", coord_x(coord
, b
), coord_y(coord
, b
));
64 board_print(b
, stderr
);
69 fprintf(stderr
, "Ignoring superko at %d,%d in\n", coord_x(coord
, b
), coord_y(coord
, b
));
70 board_print(b
, stderr
);
72 b
->superko_violation
= false;
78 char *cs
= coord2str(coord
, b
);
79 fprintf(stderr
, "%s %s\n", stone2str(color
), cs
);
83 if (amafmap
&& amafmap
->map
[coord
] == S_NONE
)
84 amafmap
->map
[coord
] = color
;
86 if (unlikely(is_pass(coord
))) {
92 color
= stone_other(color
);
95 float score
= board_fast_score(b
);
96 bool result
= (starting_color
== S_WHITE
? (score
> 0) : (score
< 0));
99 fprintf(stderr
, "Random playout result: %d (W %f)\n", result
, score
);
101 board_print(b
, stderr
);