1 /* Heuristical playout (and tree prior) policy modelled primarily after
2 * the description of the Mogo engine. */
12 #include "joseki/base.h"
16 #include "playout/moggy.h"
18 #include "tactics/1lib.h"
19 #include "tactics/2lib.h"
20 #include "tactics/nlib.h"
21 #include "tactics/ladder.h"
22 #include "tactics/nakade.h"
23 #include "tactics/selfatari.h"
24 #include "uct/prior.h"
26 #define PLDEBUGL(n) DEBUGL_(p->debug_level, n)
29 /* In case "seqchoose" move picker is enabled (i.e. no "fullchoose"
30 * parameter passed), we stochastically apply fixed set of decision
31 * rules in given order.
33 * In "fullchoose" mode, we instead build a move queue of variously
34 * tagged candidates, then consider a probability distribution over
35 * them and pick a move from that. */
37 /* Move queue tags. Some may be even undesirable - these moves then
38 * receive a penalty; penalty tags should be used only when it is
39 * certain the move would be considered anyway. */
44 #define MQ_LADDER MQ_L2LIB /* XXX: We want to fit in char still! */
54 /* Note that the context can be shared by multiple threads! */
57 unsigned int lcapturerate
, atarirate
, nlibrate
, ladderrate
, capturerate
, patternrate
, korate
, josekirate
, nakaderate
;
58 unsigned int selfatarirate
, eyefillrate
, alwaysccaprate
;
59 unsigned int fillboardtries
;
61 /* Whether to look for patterns around second-to-last move. */
63 /* Whether, when self-atari attempt is detected, to play the other
64 * group's liberty if that is non-self-atari. */
66 /* Whether to read out ladders elsewhere than near the board
67 * in the playouts. Note that such ladder testing is currently
68 * a fairly expensive operation. */
72 /* Whether to always pick from moves capturing all groups in
73 * global_atari_check(). */
75 /* Prior stone weighting. Weight of each stone between
76 * cap_stone_min and cap_stone_max is (assess*100)/cap_stone_denom. */
77 int cap_stone_min
, cap_stone_max
;
81 bool atari_def_no_hopeless
;
87 struct joseki_dict
*jdict
;
88 struct pattern3s patterns
;
90 /* Gamma values for queue tags - correspond to probabilities. */
93 double mq_prob
[MQ_MAX
], tenuki_prob
;
97 static char moggy_patterns_src
[][11] = {
98 /* hane pattern - enclosing hane */
102 /* hane pattern - non-cutting hane */
106 /* hane pattern - magari */
110 /* hane pattern - thin hane */
114 /* generic pattern - katatsuke or diagonal attachment; similar to magari */
118 /* cut1 pattern (kiri) - unprotected cut */
122 /* cut1 pattern (kiri) - peeped cut */
126 /* cut2 pattern (de) */
130 /* cut keima (not in Mogo) */
133 "???", /* o?? has some pathological tsumego cases */
134 /* side pattern - chase */
138 /* side pattern - block side cut */
142 /* side pattern - block side connection */
146 /* side pattern - sagari (SUSPICIOUS) */
148 "x.x" /* Mogo has "x.?" */
149 "###" /* Mogo has "X" */,
150 /* side pattern - throw-in (SUSPICIOUS) */
156 /* side pattern - cut (SUSPICIOUS) */
159 "###" /* Mogo has "X" */,
160 /* side pattern - eye piercing:
165 /* side pattern - make eye */
175 #define moggy_patterns_src_n sizeof(moggy_patterns_src) / sizeof(moggy_patterns_src[0])
178 test_pattern3_here(struct playout_policy
*p
, struct board
*b
, struct move
*m
, bool middle_ladder
)
180 struct moggy_policy
*pp
= p
->data
;
181 /* Check if 3x3 pattern is matched by given move... */
182 if (!pattern3_move_here(&pp
->patterns
, b
, m
))
184 /* ...and the move is not obviously stupid. */
185 if (is_bad_selfatari(b
, m
->color
, m
->coord
))
187 /* Ladder moves are stupid. */
188 group_t atari_neighbor
= board_get_atari_neighbor(b
, m
->coord
, m
->color
);
189 if (atari_neighbor
&& is_ladder(b
, m
->coord
, atari_neighbor
, middle_ladder
)
190 && !can_countercapture(b
, board_at(b
, group_base(atari_neighbor
)),
191 atari_neighbor
, m
->color
, NULL
, 0))
197 apply_pattern_here(struct playout_policy
*p
, struct board
*b
, coord_t c
, enum stone color
, struct move_queue
*q
)
199 struct moggy_policy
*pp
= p
->data
;
200 struct move m2
= { .coord
= c
, .color
= color
};
201 if (board_is_valid_move(b
, &m2
) && test_pattern3_here(p
, b
, &m2
, pp
->middle_ladder
))
202 mq_add(q
, c
, 1<<MQ_PAT3
);
205 /* Check if we match any pattern around given move (with the other color to play). */
207 apply_pattern(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move
*mm
, struct move_queue
*q
)
209 /* Suicides do not make any patterns and confuse us. */
210 if (board_at(b
, m
->coord
) == S_NONE
|| board_at(b
, m
->coord
) == S_OFFBOARD
)
213 foreach_8neighbor(b
, m
->coord
) {
214 apply_pattern_here(p
, b
, c
, stone_other(m
->color
), q
);
215 } foreach_8neighbor_end
;
217 if (mm
) { /* Second move for pattern searching */
218 foreach_8neighbor(b
, mm
->coord
) {
219 if (coord_is_8adjecent(m
->coord
, c
, b
))
221 apply_pattern_here(p
, b
, c
, stone_other(m
->color
), q
);
222 } foreach_8neighbor_end
;
226 mq_print(q
, b
, "Pattern");
231 joseki_check(struct playout_policy
*p
, struct board
*b
, enum stone to_play
, struct move_queue
*q
)
233 struct moggy_policy
*pp
= p
->data
;
237 for (int i
= 0; i
< 4; i
++) {
238 hash_t h
= b
->qhash
[i
] & joseki_hash_mask
;
239 coord_t
*cc
= pp
->jdict
->patterns
[h
].moves
[to_play
];
241 for (; !is_pass(*cc
); cc
++) {
242 if (coord_quadrant(*cc
, b
) != i
)
244 mq_add(q
, *cc
, 1<<MQ_JOSEKI
);
248 if (q
->moves
> 0 && PLDEBUGL(5))
249 mq_print(q
, b
, "Joseki");
253 global_atari_check(struct playout_policy
*p
, struct board
*b
, enum stone to_play
, struct move_queue
*q
)
258 struct moggy_policy
*pp
= p
->data
;
259 if (pp
->capcheckall
) {
260 for (int g
= 0; g
< b
->clen
; g
++)
261 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, q
, NULL
, pp
->middle_ladder
, 1<<MQ_GATARI
);
263 mq_print(q
, b
, "Global atari");
268 int g_base
= fast_random(b
->clen
);
269 for (int g
= g_base
; g
< b
->clen
; g
++) {
270 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, q
, NULL
, pp
->middle_ladder
, 1<<MQ_GATARI
);
272 /* XXX: Try carrying on. */
274 mq_print(q
, b
, "Global atari");
279 for (int g
= 0; g
< g_base
; g
++) {
280 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, q
, NULL
, pp
->middle_ladder
, 1<<MQ_GATARI
);
282 /* XXX: Try carrying on. */
284 mq_print(q
, b
, "Global atari");
292 local_atari_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
294 struct moggy_policy
*pp
= p
->data
;
296 /* Did the opponent play a self-atari? */
297 if (board_group_info(b
, group_at(b
, m
->coord
)).libs
== 1) {
298 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, m
->coord
), stone_other(m
->color
), q
, NULL
, pp
->middle_ladder
, 1<<MQ_LATARI
);
301 foreach_neighbor(b
, m
->coord
, {
302 group_t g
= group_at(b
, c
);
303 if (!g
|| board_group_info(b
, g
).libs
!= 1)
305 group_atari_check(pp
->alwaysccaprate
, b
, g
, stone_other(m
->color
), q
, NULL
, pp
->middle_ladder
, 1<<MQ_LATARI
);
309 mq_print(q
, b
, "Local atari");
314 local_ladder_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
316 group_t group
= group_at(b
, m
->coord
);
318 if (board_group_info(b
, group
).libs
!= 2)
321 for (int i
= 0; i
< 2; i
++) {
322 coord_t chase
= board_group_info(b
, group
).lib
[i
];
323 coord_t escape
= board_group_info(b
, group
).lib
[1 - i
];
324 if (wouldbe_ladder(b
, group
, escape
, chase
, board_at(b
, group
)))
325 mq_add(q
, chase
, 1<<MQ_LADDER
);
328 if (q
->moves
> 0 && PLDEBUGL(5))
329 mq_print(q
, b
, "Ladder");
334 local_2lib_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
336 struct moggy_policy
*pp
= p
->data
;
337 group_t group
= group_at(b
, m
->coord
), group2
= 0;
339 /* Does the opponent have just two liberties? */
340 if (board_group_info(b
, group
).libs
== 2) {
341 group_2lib_check(b
, group
, stone_other(m
->color
), q
, 1<<MQ_L2LIB
, pp
->atari_miaisafe
, pp
->atari_def_no_hopeless
);
343 /* We always prefer to take off an enemy chain liberty
344 * before pulling out ourselves. */
345 /* XXX: We aren't guaranteed to return to that group
348 return q
->move
[fast_random(q
->moves
)];
352 /* Then he took a third liberty from neighboring chain? */
353 foreach_neighbor(b
, m
->coord
, {
354 group_t g
= group_at(b
, c
);
355 if (!g
|| g
== group
|| g
== group2
|| board_group_info(b
, g
).libs
!= 2)
357 group_2lib_check(b
, g
, stone_other(m
->color
), q
, 1<<MQ_L2LIB
, pp
->atari_miaisafe
, pp
->atari_def_no_hopeless
);
358 group2
= g
; // prevent trivial repeated checks
362 mq_print(q
, b
, "Local 2lib");
366 local_nlib_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
368 struct moggy_policy
*pp
= p
->data
;
369 enum stone color
= stone_other(m
->color
);
371 /* Attacking N-liberty groups in general is probably
372 * not feasible. What we are primarily concerned about is
373 * counter-attacking groups that have two physical liberties,
374 * but three effective liberties:
383 * The time for this to come is when the opponent took a liberty
384 * of ours, making a few-liberty group. Therefore, we focus
387 * There is a tradeoff - down to how many liberties we need to
388 * be to start looking? nlib_count=3 will work for the left black
389 * group (2lib-solver will suggest connecting the false eye), but
390 * not for top black group (it is too late to start playing 3-3
391 * capturing race). Also, we cannot prevent stupidly taking an
392 * outside liberty ourselves; the higher nlib_count, the higher
393 * the chance we withstand this.
395 * However, higher nlib_count means that we will waste more time
396 * checking non-urgent or alive groups, and we will play silly
397 * or wasted moves around alive groups. */
400 foreach_8neighbor(b
, m
->coord
) {
401 group_t g
= group_at(b
, c
);
402 if (!g
|| group2
== g
|| board_at(b
, c
) != color
)
404 if (board_group_info(b
, g
).libs
< 3 || board_group_info(b
, g
).libs
> pp
->nlib_count
)
406 group_nlib_defense_check(b
, g
, color
, q
, 1<<MQ_LNLIB
);
407 group2
= g
; // prevent trivial repeated checks
408 } foreach_8neighbor_end
;
411 mq_print(q
, b
, "Local nlib");
415 nakade_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, enum stone to_play
)
417 coord_t empty
= pass
;
418 foreach_neighbor(b
, m
->coord
, {
419 if (board_at(b
, c
) != S_NONE
)
421 if (is_pass(empty
)) {
425 if (!coord_is_8adjecent(c
, empty
, b
)) {
426 /* Seems like impossible nakade
431 assert(!is_pass(empty
));
433 coord_t nakade
= nakade_point(b
, empty
, stone_other(to_play
));
434 if (PLDEBUGL(5) && !is_pass(nakade
))
435 fprintf(stderr
, "Nakade: %s\n", coord2sstr(nakade
, b
));
440 fillboard_check(struct playout_policy
*p
, struct board
*b
)
442 struct moggy_policy
*pp
= p
->data
;
443 unsigned int fbtries
= b
->flen
/ 8;
444 if (pp
->fillboardtries
< fbtries
)
445 fbtries
= pp
->fillboardtries
;
447 for (unsigned int i
= 0; i
< fbtries
; i
++) {
448 coord_t coord
= b
->f
[fast_random(b
->flen
)];
449 if (immediate_liberty_count(b
, coord
) != 4)
451 foreach_diag_neighbor(b
, coord
) {
452 if (board_at(b
, c
) != S_NONE
)
454 } foreach_diag_neighbor_end
;
463 playout_moggy_seqchoose(struct playout_policy
*p
, struct playout_setup
*s
, struct board
*b
, enum stone to_play
)
465 struct moggy_policy
*pp
= p
->data
;
468 board_print(b
, stderr
);
471 if (!is_pass(b
->last_ko
.coord
) && is_pass(b
->ko
.coord
)
472 && b
->moves
- b
->last_ko_age
< pp
->koage
473 && pp
->korate
> fast_random(100)) {
474 if (board_is_valid_play(b
, to_play
, b
->last_ko
.coord
)
475 && !is_bad_selfatari(b
, to_play
, b
->last_ko
.coord
))
476 return b
->last_ko
.coord
;
480 if (!is_pass(b
->last_move
.coord
)) {
482 if (pp
->nakaderate
> fast_random(100)
483 && immediate_liberty_count(b
, b
->last_move
.coord
) > 0) {
484 coord_t nakade
= nakade_check(p
, b
, &b
->last_move
, to_play
);
485 if (!is_pass(nakade
))
489 /* Local group in atari? */
490 if (pp
->lcapturerate
> fast_random(100)) {
491 struct move_queue q
; q
.moves
= 0;
492 local_atari_check(p
, b
, &b
->last_move
, &q
);
497 /* Local group trying to escape ladder? */
498 if (pp
->ladderrate
> fast_random(100)) {
499 struct move_queue q
; q
.moves
= 0;
500 local_ladder_check(p
, b
, &b
->last_move
, &q
);
505 /* Local group can be PUT in atari? */
506 if (pp
->atarirate
> fast_random(100)) {
507 struct move_queue q
; q
.moves
= 0;
508 local_2lib_check(p
, b
, &b
->last_move
, &q
);
513 /* Local group reduced some of our groups to 3 libs? */
514 if (pp
->nlibrate
> fast_random(100)) {
515 struct move_queue q
; q
.moves
= 0;
516 local_nlib_check(p
, b
, &b
->last_move
, &q
);
521 /* Check for patterns we know */
522 if (pp
->patternrate
> fast_random(100)) {
523 struct move_queue q
; q
.moves
= 0;
524 apply_pattern(p
, b
, &b
->last_move
,
525 pp
->pattern2
&& b
->last_move2
.coord
>= 0 ? &b
->last_move2
: NULL
,
534 /* Any groups in atari? */
535 if (pp
->capturerate
> fast_random(100)) {
536 struct move_queue q
; q
.moves
= 0;
537 global_atari_check(p
, b
, to_play
, &q
);
543 if (pp
->josekirate
> fast_random(100)) {
544 struct move_queue q
; q
.moves
= 0;
545 joseki_check(p
, b
, to_play
, &q
);
551 if (pp
->fillboardtries
> 0) {
552 coord_t c
= fillboard_check(p
, b
);
560 /* Pick a move from queue q, giving different likelihoods to moves
561 * based on their tags. */
563 mq_tagged_choose(struct playout_policy
*p
, struct board
*b
, enum stone to_play
, struct move_queue
*q
)
565 struct moggy_policy
*pp
= p
->data
;
567 /* First, merge all entries for a move. */
568 /* We use a naive O(N^2) since the average length of the queue
570 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
571 for (unsigned int j
= i
+ 1; j
< q
->moves
; j
++) {
572 if (q
->move
[i
] != q
->move
[j
])
574 q
->tag
[i
] |= q
->tag
[j
];
576 q
->tag
[j
] = q
->tag
[q
->moves
];
577 q
->move
[j
] = q
->move
[q
->moves
];
581 /* Now, construct a probdist. */
584 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
586 assert(q
->tag
[i
] != 0);
587 for (int j
= 0; j
< MQ_MAX
; j
++)
588 if (q
->tag
[i
] & (1<<j
)) {
589 //fprintf(stderr, "%s(%x) %d %f *= %f\n", coord2sstr(q->move[i], b), q->tag[i], j, val, pp->mq_prob[j]);
590 val
*= pp
->mq_prob
[j
];
592 pd
[i
] = double_to_fixp(val
);
595 total
+= double_to_fixp(pp
->tenuki_prob
);
597 /* Finally, pick a move! */
598 fixp_t stab
= fast_irandom(total
);
599 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
600 //fprintf(stderr, "%s(%x) %f (%f/%f)\n", coord2sstr(q->move[i], b), q->tag[i], fixp_to_double(stab), fixp_to_double(pd[i]), fixp_to_double(total));
607 assert(stab
< double_to_fixp(pp
->tenuki_prob
));
612 playout_moggy_fullchoose(struct playout_policy
*p
, struct playout_setup
*s
, struct board
*b
, enum stone to_play
)
614 struct moggy_policy
*pp
= p
->data
;
615 struct move_queue q
; q
.moves
= 0;
618 board_print(b
, stderr
);
621 if (pp
->korate
> 0 && !is_pass(b
->last_ko
.coord
) && is_pass(b
->ko
.coord
)
622 && b
->moves
- b
->last_ko_age
< pp
->koage
) {
623 if (board_is_valid_play(b
, to_play
, b
->last_ko
.coord
)
624 && !is_bad_selfatari(b
, to_play
, b
->last_ko
.coord
))
625 mq_add(&q
, b
->last_ko
.coord
, 1<<MQ_KO
);
629 if (!is_pass(b
->last_move
.coord
)) {
631 if (pp
->nakaderate
> 0 && immediate_liberty_count(b
, b
->last_move
.coord
) > 0) {
632 coord_t nakade
= nakade_check(p
, b
, &b
->last_move
, to_play
);
633 if (!is_pass(nakade
))
634 mq_add(&q
, nakade
, 1<<MQ_NAKADE
);
637 /* Local group in atari? */
638 if (pp
->lcapturerate
> 0)
639 local_atari_check(p
, b
, &b
->last_move
, &q
);
641 /* Local group trying to escape ladder? */
642 if (pp
->ladderrate
> 0)
643 local_ladder_check(p
, b
, &b
->last_move
, &q
);
645 /* Local group can be PUT in atari? */
646 if (pp
->atarirate
> 0)
647 local_2lib_check(p
, b
, &b
->last_move
, &q
);
649 /* Local group reduced some of our groups to 3 libs? */
650 if (pp
->nlibrate
> 0)
651 local_nlib_check(p
, b
, &b
->last_move
, &q
);
653 /* Check for patterns we know */
654 if (pp
->patternrate
> 0)
655 apply_pattern(p
, b
, &b
->last_move
,
656 pp
->pattern2
&& b
->last_move2
.coord
>= 0 ? &b
->last_move2
: NULL
,
662 /* Any groups in atari? */
663 if (pp
->capturerate
> 0)
664 global_atari_check(p
, b
, to_play
, &q
);
667 if (pp
->josekirate
> 0)
668 joseki_check(p
, b
, to_play
, &q
);
671 /* Average length of the queue is 1.4 move. */
672 printf("MQL %d ", q
.moves
);
673 for (unsigned int i
= 0; i
< q
.moves
; i
++)
674 printf("%s ", coord2sstr(q
.move
[i
], b
));
679 return mq_tagged_choose(p
, b
, to_play
, &q
);
682 if (pp
->fillboardtries
> 0) {
683 coord_t c
= fillboard_check(p
, b
);
693 playout_moggy_assess_group(struct playout_policy
*p
, struct prior_map
*map
, group_t g
, int games
)
695 struct moggy_policy
*pp
= p
->data
;
696 struct board
*b
= map
->b
;
697 struct move_queue q
; q
.moves
= 0;
699 if (board_group_info(b
, g
).libs
> pp
->nlib_count
)
703 fprintf(stderr
, "ASSESS of group %s:\n", coord2sstr(g
, b
));
704 board_print(b
, stderr
);
707 if (board_group_info(b
, g
).libs
> 2) {
710 if (board_at(b
, g
) != map
->to_play
)
711 return; // we do only defense
712 group_nlib_defense_check(b
, g
, map
->to_play
, &q
, 0);
714 coord_t coord
= q
.move
[q
.moves
];
716 fprintf(stderr
, "1.0: nlib %s\n", coord2sstr(coord
, b
));
717 int assess
= games
/ 2;
718 add_prior_value(map
, coord
, 1, assess
);
723 if (board_group_info(b
, g
).libs
== 2) {
724 if (pp
->ladderrate
) {
725 /* Make sure to play the correct liberty in case
726 * this is a group that can be caught in a ladder. */
727 bool ladderable
= false;
728 for (int i
= 0; i
< 2; i
++) {
729 coord_t chase
= board_group_info(b
, g
).lib
[i
];
730 coord_t escape
= board_group_info(b
, g
).lib
[1 - i
];
731 if (wouldbe_ladder(b
, g
, escape
, chase
, board_at(b
, g
))) {
732 add_prior_value(map
, chase
, 1, games
);
737 return; // do not suggest the other lib at all
742 group_2lib_check(b
, g
, map
->to_play
, &q
, 0, pp
->atari_miaisafe
, pp
->atari_def_no_hopeless
);
744 coord_t coord
= q
.move
[q
.moves
];
746 fprintf(stderr
, "1.0: 2lib %s\n", coord2sstr(coord
, b
));
747 int assess
= games
/ 2;
748 add_prior_value(map
, coord
, 1, assess
);
753 /* This group, sir, is in atari! */
755 coord_t ladder
= pass
;
756 group_atari_check(pp
->alwaysccaprate
, b
, g
, map
->to_play
, &q
, &ladder
, true, 0);
758 coord_t coord
= q
.move
[q
.moves
];
760 /* _Never_ play here if this move plays out
761 * a caught ladder. */
762 if (coord
== ladder
&& !board_playing_ko_threat(b
)) {
763 /* Note that the opposite is not guarded against;
764 * we do not advise against capturing a laddered
765 * group (but we don't encourage it either). Such
766 * a move can simplify tactical situations if we
768 if (map
->to_play
!= board_at(b
, g
))
770 /* FIXME: We give the malus even if this move
771 * captures another group. */
773 fprintf(stderr
, "0.0: ladder %s\n", coord2sstr(coord
, b
));
774 add_prior_value(map
, coord
, 0, games
);
778 if (!pp
->capturerate
&& !pp
->lcapturerate
)
781 int assess
= games
* 2;
782 if (pp
->cap_stone_denom
> 0) {
783 int stones
= group_stone_count(b
, g
, pp
->cap_stone_max
) - (pp
->cap_stone_min
-1);
784 assess
+= (stones
> 0 ? stones
: 0) * games
* 100 / pp
->cap_stone_denom
;
787 fprintf(stderr
, "1.0 (%d): atari %s\n", assess
, coord2sstr(coord
, b
));
788 add_prior_value(map
, coord
, 1, assess
);
793 playout_moggy_assess_one(struct playout_policy
*p
, struct prior_map
*map
, coord_t coord
, int games
)
795 struct moggy_policy
*pp
= p
->data
;
796 struct board
*b
= map
->b
;
799 fprintf(stderr
, "ASSESS of move %s:\n", coord2sstr(coord
, b
));
800 board_print(b
, stderr
);
803 /* Is this move a self-atari? */
804 if (pp
->selfatarirate
) {
805 if (!board_playing_ko_threat(b
) && is_bad_selfatari(b
, map
->to_play
, coord
)) {
807 fprintf(stderr
, "0.0: self-atari\n");
808 add_prior_value(map
, coord
, 0, games
);
809 if (!pp
->selfatari_other
)
811 /* If we can play on the other liberty of the
812 * endangered group, do! */
813 coord
= selfatari_cousin(b
, map
->to_play
, coord
, NULL
);
817 fprintf(stderr
, "1.0: self-atari redirect %s\n", coord2sstr(coord
, b
));
818 add_prior_value(map
, coord
, 1.0, games
);
824 if (pp
->patternrate
) {
825 struct move m
= { .color
= map
->to_play
, .coord
= coord
};
826 if (test_pattern3_here(p
, b
, &m
, true)) {
828 fprintf(stderr
, "1.0: pattern\n");
829 add_prior_value(map
, coord
, 1, games
);
837 playout_moggy_assess(struct playout_policy
*p
, struct prior_map
*map
, int games
)
839 struct moggy_policy
*pp
= p
->data
;
841 /* First, go through all endangered groups. */
842 for (group_t g
= 1; g
< board_size2(map
->b
); g
++)
843 if (group_at(map
->b
, g
) == g
)
844 playout_moggy_assess_group(p
, map
, g
, games
);
846 /* Then, assess individual moves. */
847 if (!pp
->patternrate
&& !pp
->selfatarirate
)
849 foreach_free_point(map
->b
) {
850 if (map
->consider
[c
])
851 playout_moggy_assess_one(p
, map
, c
, games
);
852 } foreach_free_point_end
;
856 playout_moggy_permit(struct playout_policy
*p
, struct board
*b
, struct move
*m
)
858 struct moggy_policy
*pp
= p
->data
;
860 /* The idea is simple for now - never allow self-atari moves.
861 * They suck in general, but this also permits us to actually
862 * handle seki in the playout stage. */
864 if (fast_random(100) >= pp
->selfatarirate
) {
866 fprintf(stderr
, "skipping sar test\n");
869 bool selfatari
= is_bad_selfatari(b
, m
->color
, m
->coord
);
872 fprintf(stderr
, "__ Prohibiting self-atari %s %s\n",
873 stone2str(m
->color
), coord2sstr(m
->coord
, b
));
874 if (pp
->selfatari_other
) {
875 /* Ok, try the other liberty of the atari'd group. */
876 coord_t c
= selfatari_cousin(b
, m
->color
, m
->coord
, NULL
);
877 if (is_pass(c
)) return false;
879 fprintf(stderr
, "___ Redirecting to other lib %s\n",
888 /* Check if we don't seem to be filling our eye. This should
889 * happen only for false eyes, but some of them are in fact
890 * real eyes with diagonal filled by a dead stone. Prefer
891 * to counter-capture in that case. */
892 if (fast_random(100) >= pp
->eyefillrate
) {
894 fprintf(stderr
, "skipping eyefill test\n");
897 bool eyefill
= board_is_eyelike(b
, m
->coord
, m
->color
);
899 foreach_diag_neighbor(b
, m
->coord
) {
900 if (board_at(b
, c
) != stone_other(m
->color
))
902 switch (board_group_info(b
, group_at(b
, c
)).libs
) {
903 case 1: /* Capture! */
904 c
= board_group_info(b
, group_at(b
, c
)).lib
[0];
906 fprintf(stderr
, "___ Redirecting to capture %s\n",
910 case 2: /* Try to switch to some 2-lib neighbor. */
911 for (int i
= 0; i
< 2; i
++) {
912 coord_t l
= board_group_info(b
, group_at(b
, c
)).lib
[i
];
913 if (board_is_one_point_eye(b
, l
, board_at(b
, c
)))
915 if (is_bad_selfatari(b
, m
->color
, l
))
922 } foreach_diag_neighbor_end
;
930 struct playout_policy
*
931 playout_moggy_init(char *arg
, struct board
*b
, struct joseki_dict
*jdict
)
933 struct playout_policy
*p
= calloc2(1, sizeof(*p
));
934 struct moggy_policy
*pp
= calloc2(1, sizeof(*pp
));
936 p
->choose
= playout_moggy_seqchoose
;
937 p
->assess
= playout_moggy_assess
;
938 p
->permit
= playout_moggy_permit
;
942 /* These settings are tuned for 19x19 play with several threads
943 * on reasonable time limits (i.e., rather large number of playouts).
944 * XXX: no 9x9 tuning has been done recently. */
945 int rate
= board_large(b
) ? 80 : 90;
947 pp
->lcapturerate
= pp
->atarirate
= pp
->nlibrate
948 = pp
->selfatarirate
= pp
->josekirate
= -1U;
949 pp
->patternrate
= 100;
953 pp
->lcapturerate
= 90;
954 pp
->korate
= 20; pp
->koage
= 4;
955 pp
->alwaysccaprate
= 40;
956 pp
->eyefillrate
= 60;
957 pp
->selfatari_other
= true;
959 pp
->cap_stone_min
= 2;
960 pp
->cap_stone_max
= 15;
961 pp
->cap_stone_denom
= 200;
963 pp
->atari_def_no_hopeless
= !board_large(b
);
964 pp
->atari_miaisafe
= true;
968 double mq_prob_default
[MQ_MAX
] = {
978 memcpy(pp
->mq_prob
, mq_prob_default
, sizeof(pp
->mq_prob
));
981 char *optspec
, *next
= arg
;
984 next
+= strcspn(next
, ":");
985 if (*next
) { *next
++ = 0; } else { *next
= 0; }
987 char *optname
= optspec
;
988 char *optval
= strchr(optspec
, '=');
989 if (optval
) *optval
++ = 0;
991 if (!strcasecmp(optname
, "debug") && optval
) {
992 p
->debug_level
= atoi(optval
);
993 } else if (!strcasecmp(optname
, "lcapturerate") && optval
) {
994 pp
->lcapturerate
= atoi(optval
);
995 } else if (!strcasecmp(optname
, "ladderrate") && optval
) {
996 pp
->ladderrate
= atoi(optval
);
997 } else if (!strcasecmp(optname
, "atarirate") && optval
) {
998 pp
->atarirate
= atoi(optval
);
999 } else if (!strcasecmp(optname
, "nlibrate") && optval
) {
1000 pp
->nlibrate
= atoi(optval
);
1001 } else if (!strcasecmp(optname
, "capturerate") && optval
) {
1002 pp
->capturerate
= atoi(optval
);
1003 } else if (!strcasecmp(optname
, "patternrate") && optval
) {
1004 pp
->patternrate
= atoi(optval
);
1005 } else if (!strcasecmp(optname
, "selfatarirate") && optval
) {
1006 pp
->selfatarirate
= atoi(optval
);
1007 } else if (!strcasecmp(optname
, "eyefillrate") && optval
) {
1008 pp
->eyefillrate
= atoi(optval
);
1009 } else if (!strcasecmp(optname
, "korate") && optval
) {
1010 pp
->korate
= atoi(optval
);
1011 } else if (!strcasecmp(optname
, "josekirate") && optval
) {
1012 pp
->josekirate
= atoi(optval
);
1013 } else if (!strcasecmp(optname
, "nakaderate") && optval
) {
1014 pp
->nakaderate
= atoi(optval
);
1015 } else if (!strcasecmp(optname
, "alwaysccaprate") && optval
) {
1016 pp
->alwaysccaprate
= atoi(optval
);
1017 } else if (!strcasecmp(optname
, "rate") && optval
) {
1018 rate
= atoi(optval
);
1019 } else if (!strcasecmp(optname
, "fillboardtries")) {
1020 pp
->fillboardtries
= atoi(optval
);
1021 } else if (!strcasecmp(optname
, "koage") && optval
) {
1022 pp
->koage
= atoi(optval
);
1023 } else if (!strcasecmp(optname
, "pattern2")) {
1024 pp
->pattern2
= optval
&& *optval
== '0' ? false : true;
1025 } else if (!strcasecmp(optname
, "selfatari_other")) {
1026 pp
->selfatari_other
= optval
&& *optval
== '0' ? false : true;
1027 } else if (!strcasecmp(optname
, "capcheckall")) {
1028 pp
->capcheckall
= optval
&& *optval
== '0' ? false : true;
1029 } else if (!strcasecmp(optname
, "cap_stone_min") && optval
) {
1030 pp
->cap_stone_min
= atoi(optval
);
1031 } else if (!strcasecmp(optname
, "cap_stone_max") && optval
) {
1032 pp
->cap_stone_max
= atoi(optval
);
1033 } else if (!strcasecmp(optname
, "cap_stone_denom") && optval
) {
1034 pp
->cap_stone_denom
= atoi(optval
);
1035 } else if (!strcasecmp(optname
, "atari_miaisafe")) {
1036 pp
->atari_miaisafe
= optval
&& *optval
== '0' ? false : true;
1037 } else if (!strcasecmp(optname
, "atari_def_no_hopeless")) {
1038 pp
->atari_def_no_hopeless
= optval
&& *optval
== '0' ? false : true;
1039 } else if (!strcasecmp(optname
, "nlib_count") && optval
) {
1040 pp
->nlib_count
= atoi(optval
);
1041 } else if (!strcasecmp(optname
, "middle_ladder")) {
1042 pp
->middle_ladder
= optval
&& *optval
== '0' ? false : true;
1043 } else if (!strcasecmp(optname
, "fullchoose")) {
1044 pp
->fullchoose
= true;
1045 p
->choose
= optval
&& *optval
== '0' ? playout_moggy_seqchoose
: playout_moggy_fullchoose
;
1046 } else if (!strcasecmp(optname
, "mqprob") && optval
) {
1047 /* KO%LATARI%L2LIB%LNLIB%PAT3%GATARI%JOSEKI%NAKADE */
1048 for (int i
= 0; *optval
&& i
< MQ_MAX
; i
++) {
1049 pp
->mq_prob
[i
] = atof(optval
);
1050 optval
+= strcspn(optval
, "%");
1051 if (*optval
) optval
++;
1053 } else if (!strcasecmp(optname
, "tenukiprob") && optval
) {
1054 pp
->tenuki_prob
= atof(optval
);
1056 fprintf(stderr
, "playout-moggy: Invalid policy argument %s or missing value\n", optname
);
1061 if (pp
->lcapturerate
== -1U) pp
->lcapturerate
= rate
;
1062 if (pp
->atarirate
== -1U) pp
->atarirate
= rate
;
1063 if (pp
->nlibrate
== -1U) pp
->nlibrate
= rate
;
1064 if (pp
->capturerate
== -1U) pp
->capturerate
= rate
;
1065 if (pp
->patternrate
== -1U) pp
->patternrate
= rate
;
1066 if (pp
->selfatarirate
== -1U) pp
->selfatarirate
= rate
;
1067 if (pp
->eyefillrate
== -1U) pp
->eyefillrate
= rate
;
1068 if (pp
->korate
== -1U) pp
->korate
= rate
;
1069 if (pp
->josekirate
== -1U) pp
->josekirate
= rate
;
1070 if (pp
->ladderrate
== -1U) pp
->ladderrate
= rate
;
1071 if (pp
->nakaderate
== -1U) pp
->nakaderate
= rate
;
1072 if (pp
->alwaysccaprate
== -1U) pp
->alwaysccaprate
= rate
;
1074 pattern3s_init(&pp
->patterns
, moggy_patterns_src
, moggy_patterns_src_n
);