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. */
53 /* Note that the context can be shared by multiple threads! */
56 unsigned int lcapturerate
, atarirate
, nlibrate
, capturerate
, patternrate
, korate
, josekirate
, nakaderate
;
57 unsigned int selfatarirate
, alwaysccaprate
;
58 unsigned int fillboardtries
;
60 /* Whether to look for patterns around second-to-last move. */
62 /* Whether, when self-atari attempt is detected, to play the other
63 * group's liberty if that is non-self-atari. */
65 /* Whether to always pick from moves capturing all groups in
66 * global_atari_check(). */
69 bool atari_def_no_hopeless
;
74 struct joseki_dict
*jdict
;
75 struct pattern3s patterns
;
77 /* Gamma values for queue tags - correspond to probabilities. */
79 double mq_prob
[MQ_MAX
], tenuki_prob
;
83 static char moggy_patterns_src
[][11] = {
84 /* hane pattern - enclosing hane */
88 /* hane pattern - non-cutting hane */
92 /* hane pattern - magari */
96 /* hane pattern - thin hane */
100 /* generic pattern - katatsuke or diagonal attachment; similar to magari */
104 /* cut1 pattern (kiri) - unprotected cut */
108 /* cut1 pattern (kiri) - peeped cut */
112 /* cut2 pattern (de) */
116 /* cut keima (not in Mogo) */
119 "???", /* o?? has some pathological tsumego cases */
120 /* side pattern - chase */
124 /* side pattern - block side cut */
128 /* side pattern - block side connection */
132 /* side pattern - sagari (SUSPICIOUS) */
134 "x.x" /* Mogo has "x.?" */
135 "###" /* Mogo has "X" */,
136 /* side pattern - throw-in (SUSPICIOUS) */
142 /* side pattern - cut (SUSPICIOUS) */
145 "###" /* Mogo has "X" */,
146 /* side pattern - eye piercing:
157 #define moggy_patterns_src_n sizeof(moggy_patterns_src) / sizeof(moggy_patterns_src[0])
160 test_pattern3_here(struct playout_policy
*p
, struct board
*b
, struct move
*m
)
162 struct moggy_policy
*pp
= p
->data
;
163 /* Check if 3x3 pattern is matched by given move... */
164 if (!pattern3_move_here(&pp
->patterns
, b
, m
))
166 /* ...and the move is not obviously stupid. */
167 if (is_bad_selfatari(b
, m
->color
, m
->coord
))
169 /* Ladder moves are stupid. */
170 group_t atari_neighbor
= board_get_atari_neighbor(b
, m
->coord
, m
->color
);
171 if (atari_neighbor
&& is_ladder(b
, m
->coord
, atari_neighbor
))
177 apply_pattern_here(struct playout_policy
*p
, struct board
*b
, coord_t c
, enum stone color
, struct move_queue
*q
)
179 struct move m2
= { .coord
= c
, .color
= color
};
180 if (board_is_valid_move(b
, &m2
) && test_pattern3_here(p
, b
, &m2
))
181 mq_add(q
, c
, 1<<MQ_PAT3
);
184 /* Check if we match any pattern around given move (with the other color to play). */
186 apply_pattern(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move
*mm
, struct move_queue
*q
)
188 /* Suicides do not make any patterns and confuse us. */
189 if (board_at(b
, m
->coord
) == S_NONE
|| board_at(b
, m
->coord
) == S_OFFBOARD
)
192 foreach_8neighbor(b
, m
->coord
) {
193 apply_pattern_here(p
, b
, c
, stone_other(m
->color
), q
);
194 } foreach_8neighbor_end
;
196 if (mm
) { /* Second move for pattern searching */
197 foreach_8neighbor(b
, mm
->coord
) {
198 if (coord_is_8adjecent(m
->coord
, c
, b
))
200 apply_pattern_here(p
, b
, c
, stone_other(m
->color
), q
);
201 } foreach_8neighbor_end
;
205 mq_print(q
, b
, "Pattern");
210 joseki_check(struct playout_policy
*p
, struct board
*b
, enum stone to_play
, struct move_queue
*q
)
212 struct moggy_policy
*pp
= p
->data
;
216 for (int i
= 0; i
< 4; i
++) {
217 hash_t h
= b
->qhash
[i
] & joseki_hash_mask
;
218 coord_t
*cc
= pp
->jdict
->patterns
[h
].moves
[to_play
];
220 for (; !is_pass(*cc
); cc
++) {
221 if (coord_quadrant(*cc
, b
) != i
)
223 mq_add(q
, *cc
, 1<<MQ_JOSEKI
);
227 if (q
->moves
> 0 && PLDEBUGL(5))
228 mq_print(q
, b
, "Joseki");
232 global_atari_check(struct playout_policy
*p
, struct board
*b
, enum stone to_play
, struct move_queue
*q
)
237 struct moggy_policy
*pp
= p
->data
;
238 if (pp
->capcheckall
) {
239 for (int g
= 0; g
< b
->clen
; g
++)
240 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, q
, NULL
, 1<<MQ_GATARI
);
242 mq_print(q
, b
, "Global atari");
246 int g_base
= fast_random(b
->clen
);
247 for (int g
= g_base
; g
< b
->clen
; g
++) {
248 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, q
, NULL
, 1<<MQ_GATARI
);
250 /* XXX: Try carrying on. */
252 mq_print(q
, b
, "Global atari");
256 for (int g
= 0; g
< g_base
; g
++) {
257 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, q
, NULL
, 1<<MQ_GATARI
);
259 /* XXX: Try carrying on. */
261 mq_print(q
, b
, "Global atari");
269 local_atari_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
271 struct moggy_policy
*pp
= p
->data
;
273 /* Did the opponent play a self-atari? */
274 if (board_group_info(b
, group_at(b
, m
->coord
)).libs
== 1) {
275 group_atari_check(pp
->alwaysccaprate
, b
, group_at(b
, m
->coord
), stone_other(m
->color
), q
, NULL
, 1<<MQ_LATARI
);
278 foreach_neighbor(b
, m
->coord
, {
279 group_t g
= group_at(b
, c
);
280 if (!g
|| board_group_info(b
, g
).libs
!= 1)
282 group_atari_check(pp
->alwaysccaprate
, b
, g
, stone_other(m
->color
), q
, NULL
, 1<<MQ_LATARI
);
286 mq_print(q
, b
, "Local atari");
291 local_2lib_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
293 struct moggy_policy
*pp
= p
->data
;
294 group_t group
= group_at(b
, m
->coord
), group2
= 0;
296 /* Does the opponent have just two liberties? */
297 if (board_group_info(b
, group
).libs
== 2) {
298 group_2lib_check(b
, group
, stone_other(m
->color
), q
, 1<<MQ_L2LIB
, pp
->atari_miaisafe
, pp
->atari_def_no_hopeless
);
300 /* We always prefer to take off an enemy chain liberty
301 * before pulling out ourselves. */
302 /* XXX: We aren't guaranteed to return to that group
305 return q
->move
[fast_random(q
->moves
)];
309 /* Then he took a third liberty from neighboring chain? */
310 foreach_neighbor(b
, m
->coord
, {
311 group_t g
= group_at(b
, c
);
312 if (!g
|| g
== group
|| g
== group2
|| board_group_info(b
, g
).libs
!= 2)
314 group_2lib_check(b
, g
, stone_other(m
->color
), q
, 1<<MQ_L2LIB
, pp
->atari_miaisafe
, pp
->atari_def_no_hopeless
);
315 group2
= g
; // prevent trivial repeated checks
319 mq_print(q
, b
, "Local 2lib");
323 local_nlib_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move_queue
*q
)
325 struct moggy_policy
*pp
= p
->data
;
326 enum stone color
= stone_other(m
->color
);
328 /* Attacking N-liberty groups in general is probably
329 * not feasible. What we are primarily concerned about is
330 * counter-attacking groups that have two physical liberties,
331 * but three effective liberties:
340 * The time for this to come is when the opponent took a liberty
341 * of ours, making a few-liberty group. Therefore, we focus
344 * There is a tradeoff - down to how many liberties we need to
345 * be to start looking? nlib_count=3 will work for the left black
346 * group (2lib-solver will suggest connecting the false eye), but
347 * not for top black group (it is too late to start playing 3-3
348 * capturing race). Also, we cannot prevent stupidly taking an
349 * outside liberty ourselves; the higher nlib_count, the higher
350 * the chance we withstand this.
352 * However, higher nlib_count means that we will waste more time
353 * checking non-urgent or alive groups, and we will play silly
354 * or wasted moves around alive groups. */
357 foreach_8neighbor(b
, m
->coord
) {
358 group_t g
= group_at(b
, c
);
359 if (!g
|| group2
== g
|| board_at(b
, c
) != color
)
361 if (board_group_info(b
, g
).libs
< 3 || board_group_info(b
, g
).libs
> pp
->nlib_count
)
363 group_nlib_defense_check(b
, g
, color
, q
, 1<<MQ_LNLIB
);
364 group2
= g
; // prevent trivial repeated checks
365 } foreach_8neighbor_end
;
368 mq_print(q
, b
, "Local nlib");
372 nakade_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
, enum stone to_play
)
374 coord_t empty
= pass
;
375 foreach_neighbor(b
, m
->coord
, {
376 if (board_at(b
, c
) != S_NONE
)
378 if (is_pass(empty
)) {
382 if (!coord_is_8adjecent(c
, empty
, b
)) {
383 /* Seems like impossible nakade
388 assert(!is_pass(empty
));
390 coord_t nakade
= nakade_point(b
, empty
, stone_other(to_play
));
391 if (PLDEBUGL(5) && !is_pass(nakade
))
392 fprintf(stderr
, "Nakade: %s\n", coord2sstr(nakade
, b
));
397 fillboard_check(struct playout_policy
*p
, struct board
*b
)
399 struct moggy_policy
*pp
= p
->data
;
400 unsigned int fbtries
= b
->flen
/ 8;
401 if (pp
->fillboardtries
< fbtries
)
402 fbtries
= pp
->fillboardtries
;
404 for (unsigned int i
= 0; i
< fbtries
; i
++) {
405 coord_t coord
= b
->f
[fast_random(b
->flen
)];
406 if (immediate_liberty_count(b
, coord
) != 4)
408 foreach_diag_neighbor(b
, coord
) {
409 if (board_at(b
, c
) != S_NONE
)
411 } foreach_diag_neighbor_end
;
420 playout_moggy_seqchoose(struct playout_policy
*p
, struct playout_setup
*s
, struct board
*b
, enum stone to_play
)
422 struct moggy_policy
*pp
= p
->data
;
425 board_print(b
, stderr
);
428 if (!is_pass(b
->last_ko
.coord
) && is_pass(b
->ko
.coord
)
429 && b
->moves
- b
->last_ko_age
< pp
->koage
430 && pp
->korate
> fast_random(100)) {
431 if (board_is_valid_play(b
, to_play
, b
->last_ko
.coord
)
432 && !is_bad_selfatari(b
, to_play
, b
->last_ko
.coord
))
433 return b
->last_ko
.coord
;
437 if (!is_pass(b
->last_move
.coord
)) {
439 if (pp
->nakaderate
> fast_random(100)
440 && immediate_liberty_count(b
, b
->last_move
.coord
) > 0) {
441 coord_t nakade
= nakade_check(p
, b
, &b
->last_move
, to_play
);
442 if (!is_pass(nakade
))
446 /* Local group in atari? */
447 if (pp
->lcapturerate
> fast_random(100)) {
448 struct move_queue q
; q
.moves
= 0;
449 local_atari_check(p
, b
, &b
->last_move
, &q
);
454 /* Local group can be PUT in atari? */
455 if (pp
->atarirate
> fast_random(100)) {
456 struct move_queue q
; q
.moves
= 0;
457 local_2lib_check(p
, b
, &b
->last_move
, &q
);
462 /* Local group reduced some of our groups to 3 libs? */
463 if (pp
->nlibrate
> fast_random(100)) {
464 struct move_queue q
; q
.moves
= 0;
465 local_nlib_check(p
, b
, &b
->last_move
, &q
);
470 /* Check for patterns we know */
471 if (pp
->patternrate
> fast_random(100)) {
472 struct move_queue q
; q
.moves
= 0;
473 apply_pattern(p
, b
, &b
->last_move
,
474 pp
->pattern2
&& b
->last_move2
.coord
>= 0 ? &b
->last_move2
: NULL
,
483 /* Any groups in atari? */
484 if (pp
->capturerate
> fast_random(100)) {
485 struct move_queue q
; q
.moves
= 0;
486 global_atari_check(p
, b
, to_play
, &q
);
492 if (pp
->josekirate
> fast_random(100)) {
493 struct move_queue q
; q
.moves
= 0;
494 joseki_check(p
, b
, to_play
, &q
);
500 if (pp
->fillboardtries
> 0) {
501 coord_t c
= fillboard_check(p
, b
);
509 /* Pick a move from queue q, giving different likelihoods to moves
510 * based on their tags. */
512 mq_tagged_choose(struct playout_policy
*p
, struct board
*b
, enum stone to_play
, struct move_queue
*q
)
514 struct moggy_policy
*pp
= p
->data
;
516 /* First, merge all entries for a move. */
517 /* We use a naive O(N^2) since the average length of the queue
519 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
520 for (unsigned int j
= i
+ 1; j
< q
->moves
; j
++) {
521 if (q
->move
[i
] != q
->move
[j
])
523 q
->tag
[i
] |= q
->tag
[j
];
525 q
->tag
[j
] = q
->tag
[q
->moves
];
526 q
->move
[j
] = q
->move
[q
->moves
];
530 /* Now, construct a probdist. */
533 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
535 assert(q
->tag
[i
] != 0);
536 for (int j
= 0; j
< MQ_MAX
; j
++)
537 if (q
->tag
[i
] & (1<<j
)) {
538 //fprintf(stderr, "%s(%x) %d %f *= %f\n", coord2sstr(q->move[i], b), q->tag[i], j, val, pp->mq_prob[j]);
539 val
*= pp
->mq_prob
[j
];
541 pd
[i
] = double_to_fixp(val
);
544 total
+= double_to_fixp(pp
->tenuki_prob
);
546 /* Finally, pick a move! */
547 fixp_t stab
= fast_irandom(total
);
548 for (unsigned int i
= 0; i
< q
->moves
; i
++) {
549 //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));
556 assert(stab
< double_to_fixp(pp
->tenuki_prob
));
561 playout_moggy_fullchoose(struct playout_policy
*p
, struct playout_setup
*s
, struct board
*b
, enum stone to_play
)
563 struct moggy_policy
*pp
= p
->data
;
564 struct move_queue q
; q
.moves
= 0;
567 board_print(b
, stderr
);
570 if (!is_pass(b
->last_ko
.coord
) && is_pass(b
->ko
.coord
)
571 && b
->moves
- b
->last_ko_age
< pp
->koage
) {
572 if (board_is_valid_play(b
, to_play
, b
->last_ko
.coord
)
573 && !is_bad_selfatari(b
, to_play
, b
->last_ko
.coord
))
574 mq_add(&q
, b
->last_ko
.coord
, 1<<MQ_KO
);
578 if (!is_pass(b
->last_move
.coord
)) {
580 if (immediate_liberty_count(b
, b
->last_move
.coord
) > 0) {
581 coord_t nakade
= nakade_check(p
, b
, &b
->last_move
, to_play
);
582 if (!is_pass(nakade
))
583 mq_add(&q
, nakade
, 1<<MQ_NAKADE
);
586 /* Local group in atari? */
587 local_atari_check(p
, b
, &b
->last_move
, &q
);
589 /* Local group can be PUT in atari? */
590 local_2lib_check(p
, b
, &b
->last_move
, &q
);
592 /* Local group reduced some of our groups to 3 libs? */
593 local_nlib_check(p
, b
, &b
->last_move
, &q
);
595 /* Check for patterns we know */
596 apply_pattern(p
, b
, &b
->last_move
,
597 pp
->pattern2
&& b
->last_move2
.coord
>= 0 ? &b
->last_move2
: NULL
,
603 /* Any groups in atari? */
604 global_atari_check(p
, b
, to_play
, &q
);
607 joseki_check(p
, b
, to_play
, &q
);
610 /* Average length of the queue is 1.4 move. */
611 printf("MQL %d ", q
.moves
);
612 for (unsigned int i
= 0; i
< q
.moves
; i
++)
613 printf("%s ", coord2sstr(q
.move
[i
], b
));
618 return mq_tagged_choose(p
, b
, to_play
, &q
);
621 if (pp
->fillboardtries
> 0) {
622 coord_t c
= fillboard_check(p
, b
);
632 playout_moggy_assess_group(struct playout_policy
*p
, struct prior_map
*map
, group_t g
, int games
)
634 struct moggy_policy
*pp
= p
->data
;
635 struct board
*b
= map
->b
;
636 struct move_queue q
; q
.moves
= 0;
638 if (board_group_info(b
, g
).libs
> pp
->nlib_count
)
642 fprintf(stderr
, "ASSESS of group %s:\n", coord2sstr(g
, b
));
643 board_print(b
, stderr
);
646 if (board_group_info(b
, g
).libs
> 2) {
649 if (board_at(b
, g
) != map
->to_play
)
650 return; // we do only defense
651 group_nlib_defense_check(b
, g
, map
->to_play
, &q
, 0);
653 coord_t coord
= q
.move
[q
.moves
];
655 fprintf(stderr
, "1.0: nlib %s\n", coord2sstr(coord
, b
));
656 int assess
= games
/ 2;
657 add_prior_value(map
, coord
, 1, assess
);
662 if (board_group_info(b
, g
).libs
== 2) {
665 group_2lib_check(b
, g
, map
->to_play
, &q
, 0, pp
->atari_miaisafe
, pp
->atari_def_no_hopeless
);
667 coord_t coord
= q
.move
[q
.moves
];
669 fprintf(stderr
, "1.0: 2lib %s\n", coord2sstr(coord
, b
));
670 int assess
= games
/ 2;
671 add_prior_value(map
, coord
, 1, assess
);
676 /* This group, sir, is in atari! */
678 coord_t ladder
= pass
;
679 group_atari_check(pp
->alwaysccaprate
, b
, g
, map
->to_play
, &q
, &ladder
, 0);
681 coord_t coord
= q
.move
[q
.moves
];
683 /* _Never_ play here if this move plays out
684 * a caught ladder. */
685 if (coord
== ladder
&& !board_playing_ko_threat(b
)) {
686 /* Note that the opposite is not guarded against;
687 * we do not advise against capturing a laddered
688 * group (but we don't encourage it either). Such
689 * a move can simplify tactical situations if we
691 if (map
->to_play
!= board_at(b
, g
))
693 /* FIXME: We give the malus even if this move
694 * captures another group. */
696 fprintf(stderr
, "0.0: ladder %s\n", coord2sstr(coord
, b
));
697 add_prior_value(map
, coord
, 0, games
);
701 if (!pp
->capturerate
&& !pp
->lcapturerate
)
705 fprintf(stderr
, "1.0: atari %s\n", coord2sstr(coord
, b
));
706 int assess
= games
* 2;
707 add_prior_value(map
, coord
, 1, assess
);
712 playout_moggy_assess_one(struct playout_policy
*p
, struct prior_map
*map
, coord_t coord
, int games
)
714 struct moggy_policy
*pp
= p
->data
;
715 struct board
*b
= map
->b
;
718 fprintf(stderr
, "ASSESS of move %s:\n", coord2sstr(coord
, b
));
719 board_print(b
, stderr
);
722 /* Is this move a self-atari? */
723 if (pp
->selfatarirate
) {
724 if (!board_playing_ko_threat(b
) && is_bad_selfatari(b
, map
->to_play
, coord
)) {
726 fprintf(stderr
, "0.0: self-atari\n");
727 add_prior_value(map
, coord
, 0, games
);
728 if (!pp
->selfatari_other
)
730 /* If we can play on the other liberty of the
731 * endangered group, do! */
732 coord
= selfatari_cousin(b
, map
->to_play
, coord
);
736 fprintf(stderr
, "1.0: self-atari redirect %s\n", coord2sstr(coord
, b
));
737 add_prior_value(map
, coord
, 1.0, games
);
743 if (pp
->patternrate
) {
744 struct move m
= { .color
= map
->to_play
, .coord
= coord
};
745 if (test_pattern3_here(p
, b
, &m
)) {
747 fprintf(stderr
, "1.0: pattern\n");
748 add_prior_value(map
, coord
, 1, games
);
756 playout_moggy_assess(struct playout_policy
*p
, struct prior_map
*map
, int games
)
758 struct moggy_policy
*pp
= p
->data
;
760 /* First, go through all endangered groups. */
761 for (group_t g
= 1; g
< board_size2(map
->b
); g
++)
762 if (group_at(map
->b
, g
) == g
)
763 playout_moggy_assess_group(p
, map
, g
, games
);
765 /* Then, assess individual moves. */
766 if (!pp
->patternrate
&& !pp
->selfatarirate
)
768 foreach_free_point(map
->b
) {
769 if (map
->consider
[c
])
770 playout_moggy_assess_one(p
, map
, c
, games
);
771 } foreach_free_point_end
;
775 playout_moggy_permit(struct playout_policy
*p
, struct board
*b
, struct move
*m
)
777 struct moggy_policy
*pp
= p
->data
;
779 /* The idea is simple for now - never allow self-atari moves.
780 * They suck in general, but this also permits us to actually
781 * handle seki in the playout stage. */
783 if (fast_random(100) >= pp
->selfatarirate
) {
785 fprintf(stderr
, "skipping sar test\n");
788 bool selfatari
= is_bad_selfatari(b
, m
->color
, m
->coord
);
791 fprintf(stderr
, "__ Prohibiting self-atari %s %s\n",
792 stone2str(m
->color
), coord2sstr(m
->coord
, b
));
793 if (pp
->selfatari_other
) {
794 /* Ok, try the other liberty of the atari'd group. */
795 coord_t c
= selfatari_cousin(b
, m
->color
, m
->coord
);
796 if (is_pass(c
)) return false;
798 fprintf(stderr
, "___ Redirecting to other lib %s\n",
809 struct playout_policy
*
810 playout_moggy_init(char *arg
, struct board
*b
, struct joseki_dict
*jdict
)
812 struct playout_policy
*p
= calloc2(1, sizeof(*p
));
813 struct moggy_policy
*pp
= calloc2(1, sizeof(*pp
));
815 p
->choose
= playout_moggy_seqchoose
;
816 p
->assess
= playout_moggy_assess
;
817 p
->permit
= playout_moggy_permit
;
821 /* These settings are tuned for 19x19 play with several threads
822 * on reasonable time limits (i.e., rather large number of playouts).
823 * XXX: no 9x9 tuning has been done recently. */
824 int rate
= board_large(b
) ? 80 : 90;
826 pp
->lcapturerate
= pp
->atarirate
= pp
->nlibrate
= pp
->patternrate
827 = pp
->selfatarirate
= pp
->josekirate
= -1U;
828 if (board_large(b
)) {
829 pp
->lcapturerate
= 90;
830 pp
->patternrate
= 100;
834 pp
->korate
= 20; pp
->koage
= 4;
835 pp
->alwaysccaprate
= 20;
836 pp
->selfatari_other
= true;
837 pp
->atari_def_no_hopeless
= !board_large(b
);
838 pp
->atari_miaisafe
= true;
842 double mq_prob_default
[MQ_MAX
] = {
852 memcpy(pp
->mq_prob
, mq_prob_default
, sizeof(pp
->mq_prob
));
855 char *optspec
, *next
= arg
;
858 next
+= strcspn(next
, ":");
859 if (*next
) { *next
++ = 0; } else { *next
= 0; }
861 char *optname
= optspec
;
862 char *optval
= strchr(optspec
, '=');
863 if (optval
) *optval
++ = 0;
865 if (!strcasecmp(optname
, "debug") && optval
) {
866 p
->debug_level
= atoi(optval
);
867 } else if (!strcasecmp(optname
, "lcapturerate") && optval
) {
868 pp
->lcapturerate
= atoi(optval
);
869 } else if (!strcasecmp(optname
, "atarirate") && optval
) {
870 pp
->atarirate
= atoi(optval
);
871 } else if (!strcasecmp(optname
, "nlibrate") && optval
) {
872 pp
->nlibrate
= atoi(optval
);
873 } else if (!strcasecmp(optname
, "capturerate") && optval
) {
874 pp
->capturerate
= atoi(optval
);
875 } else if (!strcasecmp(optname
, "patternrate") && optval
) {
876 pp
->patternrate
= atoi(optval
);
877 } else if (!strcasecmp(optname
, "selfatarirate") && optval
) {
878 pp
->selfatarirate
= atoi(optval
);
879 } else if (!strcasecmp(optname
, "korate") && optval
) {
880 pp
->korate
= atoi(optval
);
881 } else if (!strcasecmp(optname
, "josekirate") && optval
) {
882 pp
->josekirate
= atoi(optval
);
883 } else if (!strcasecmp(optname
, "nakaderate") && optval
) {
884 pp
->nakaderate
= atoi(optval
);
885 } else if (!strcasecmp(optname
, "alwaysccaprate") && optval
) {
886 pp
->alwaysccaprate
= atoi(optval
);
887 } else if (!strcasecmp(optname
, "rate") && optval
) {
889 } else if (!strcasecmp(optname
, "fillboardtries")) {
890 pp
->fillboardtries
= atoi(optval
);
891 } else if (!strcasecmp(optname
, "koage") && optval
) {
892 pp
->koage
= atoi(optval
);
893 } else if (!strcasecmp(optname
, "pattern2")) {
894 pp
->pattern2
= optval
&& *optval
== '0' ? false : true;
895 } else if (!strcasecmp(optname
, "selfatari_other")) {
896 pp
->selfatari_other
= optval
&& *optval
== '0' ? false : true;
897 } else if (!strcasecmp(optname
, "capcheckall")) {
898 pp
->capcheckall
= optval
&& *optval
== '0' ? false : true;
899 } else if (!strcasecmp(optname
, "atari_miaisafe")) {
900 pp
->atari_miaisafe
= optval
&& *optval
== '0' ? false : true;
901 } else if (!strcasecmp(optname
, "atari_def_no_hopeless")) {
902 pp
->atari_def_no_hopeless
= optval
&& *optval
== '0' ? false : true;
903 } else if (!strcasecmp(optname
, "nlib_count") && optval
) {
904 pp
->nlib_count
= atoi(optval
);
905 } else if (!strcasecmp(optname
, "fullchoose")) {
906 p
->choose
= optval
&& *optval
== '0' ? playout_moggy_seqchoose
: playout_moggy_fullchoose
;
907 } else if (!strcasecmp(optname
, "mqprob") && optval
) {
908 /* KO%LATARI%L2LIB%LNLIB%PAT3%GATARI%JOSEKI%NAKADE */
909 for (int i
= 0; *optval
&& i
< MQ_MAX
; i
++, optval
+= strcspn(optval
, "%")) {
911 pp
->mq_prob
[i
] = atof(optval
);
913 } else if (!strcasecmp(optname
, "tenukiprob") && optval
) {
914 pp
->tenuki_prob
= atof(optval
);
916 fprintf(stderr
, "playout-moggy: Invalid policy argument %s or missing value\n", optname
);
921 if (pp
->lcapturerate
== -1U) pp
->lcapturerate
= rate
;
922 if (pp
->atarirate
== -1U) pp
->atarirate
= rate
;
923 if (pp
->capturerate
== -1U) pp
->capturerate
= rate
;
924 if (pp
->patternrate
== -1U) pp
->patternrate
= rate
;
925 if (pp
->selfatarirate
== -1U) pp
->selfatarirate
= rate
;
926 if (pp
->korate
== -1U) pp
->korate
= rate
;
927 if (pp
->josekirate
== -1U) pp
->josekirate
= rate
;
928 if (pp
->nakaderate
== -1U) pp
->nakaderate
= rate
;
929 if (pp
->alwaysccaprate
== -1U) pp
->alwaysccaprate
= rate
;
931 pattern3s_init(&pp
->patterns
, moggy_patterns_src
, moggy_patterns_src_n
);