10 #include "playout/moggy.h"
13 #define PLDEBUGL(n) DEBUGL_(p->debug_level, n)
16 /* Note that the context can be shared by multiple threads! */
19 bool ladders
, ladderassess
, borderladders
, assess_local
;
20 int lcapturerate
, capturerate
, patternrate
;
23 /* Whether to look for patterns around second-to-last move. */
26 /* Hashtable: 2*8 bits (ignore middle point, 2 bits per intersection) */
27 /* Value: 0: no pattern, 1: black pattern,
28 * 2: white pattern, 3: both patterns */
39 mq_nodup(struct move_queue
*q
)
41 if ((q
->moves
> 1 && q
->move
[q
->moves
- 2] == q
->move
[q
->moves
- 1])
42 || (q
->moves
> 2 && q
->move
[q
->moves
- 3] == q
->move
[q
->moves
- 1])
43 || (q
->moves
> 3 && q
->move
[q
->moves
- 4] == q
->move
[q
->moves
- 1]))
49 * X: black; O: white; .: empty; #: edge
50 * x: !black; o: !white; ?: any
52 * extra X: pattern valid only for one side;
53 * middle point ignored. */
55 static char moggy_patterns_src
[][11] = {
56 /* hane pattern - enclosing hane */
60 /* hane pattern - non-cutting hane */
64 /* hane pattern - magari */
68 /* hane pattern - thin hane */
72 /* generic pattern - katatsuke or diagonal attachment; similar to magari */
76 /* cut1 pattern (kiri) - unprotected cut */
80 /* cut1 pattern (kiri) - peeped cut */
84 /* cut2 pattern (de) */
88 /* cut keima (not in Mogo) */
92 /* side pattern - chase */
96 /* side pattern - weirdness (SUSPICIOUS) */
100 /* side pattern - sagari (SUSPICIOUS) */
102 "x.x" /* Mogo has "x.?" */
103 "###" /* Mogo has "X" */,
104 /* side pattern - throw-in (SUSPICIOUS) */
110 /* side pattern - cut (SUSPICIOUS) */
113 "###" /* Mogo has "X" */,
115 #define moggy_patterns_src_n sizeof(moggy_patterns_src) / sizeof(moggy_patterns_src[0])
118 pattern_record(char *table
, char *str
, int pat
, int fixed_color
)
120 /* Original color assignment */
121 table
[pat
] = fixed_color
? fixed_color
: 3;
122 //fprintf(stderr, "[%s] %04x %d\n", str, pat, fixed_color);
124 /* Reverse color assignment - achieved by swapping odd and even bits */
125 pat
= ((pat
>> 1) & 0x5555) | ((pat
& 0x5555) << 1);
126 table
[pat
] = fixed_color
? 2 - (fixed_color
== 2) : 3;
127 //fprintf(stderr, "[%s] %04x %d\n", str, pat, fixed_color);
133 /* V mirror pattern; reverse order of 3-2-3 chunks */
134 return ((pat
& 0xfc00) >> 10) | (pat
& 0x03c0) | ((pat
& 0x003f) << 10);
140 /* H mirror pattern; reverse order of 2-bit values within the chunks */
141 #define rev3(p) ((p >> 4) | (p & 0xc) | ((p & 0x3) << 4))
142 #define rev2(p) ((p >> 2) | ((p & 0x3) << 2))
143 return (rev3((pat
& 0xfc00) >> 10) << 10)
144 | (rev2((pat
& 0x03c0) >> 6) << 6)
145 | rev3((pat
& 0x003f));
153 /* Rotate by 90 degrees:
157 /* I'm too lazy to optimize this :) */
159 for (int i
= 0; i
< 8; i
++)
160 vals
[i
] = (pat
>> (i
* 2)) & 0x3;
162 vals2
[0] = vals
[5]; vals2
[1] = vals
[3]; vals2
[2] = vals
[0];
163 vals2
[3] = vals
[6]; vals2
[4] = vals
[1];
164 vals2
[5] = vals
[7]; vals2
[6] = vals
[4]; vals2
[7] = vals
[2];
166 for (int i
= 0; i
< 8; i
++)
167 p2
|= vals2
[i
] << (i
* 2);
172 pattern_gen(char *table
, int pat
, char *src
, int srclen
, int fixed_color
)
174 for (; srclen
> 0; src
++, srclen
--) {
177 int patofs
= (srclen
> 5 ? srclen
- 1 : srclen
) - 1;
180 *src
= '.'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
181 *src
= 'X'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
182 *src
= 'O'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
183 *src
= '#'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
184 *src
= '?'; // for future recursions
187 *src
= '.'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
188 *src
= 'O'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
189 *src
= '#'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
190 *src
= 'x'; // for future recursions
193 *src
= '.'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
194 *src
= 'X'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
195 *src
= '#'; pattern_gen(table
, pat
, src
, srclen
, fixed_color
);
196 *src
= 'o'; // for future recursions
198 case '.': /* 0 */ break;
199 case 'X': pat
|= S_BLACK
<< (patofs
* 2); break;
200 case 'O': pat
|= S_WHITE
<< (patofs
* 2); break;
201 case '#': pat
|= S_OFFBOARD
<< (patofs
* 2); break;
205 /* Original pattern, all transpositions and rotations */
206 pattern_record(table
, src
- 9, pat
, fixed_color
);
207 pattern_record(table
, src
- 9, pat_vmirror(pat
), fixed_color
);
208 pattern_record(table
, src
- 9, pat_hmirror(pat
), fixed_color
);
209 pattern_record(table
, src
- 9, pat_vmirror(pat_hmirror(pat
)), fixed_color
);
210 pattern_record(table
, src
- 9, pat_90rot(pat
), fixed_color
);
211 pattern_record(table
, src
- 9, pat_90rot(pat_vmirror(pat
)), fixed_color
);
212 pattern_record(table
, src
- 9, pat_90rot(pat_hmirror(pat
)), fixed_color
);
213 pattern_record(table
, src
- 9, pat_90rot(pat_vmirror(pat_hmirror(pat
))), fixed_color
);
216 #warning gcc is stupid; ignore following out-of-bounds warnings
219 patterns_gen(struct playout_policy
*p
, char src
[][11], int src_n
)
221 struct moggy_policy
*pp
= p
->data
;
223 for (int i
= 0; i
< src_n
; i
++) {
224 //printf("<%s>\n", src[i]);
227 case 'X': fixed_color
= S_BLACK
; break;
228 case 'O': fixed_color
= S_WHITE
; break;
230 //fprintf(stderr, "** %s **\n", src[i]);
231 pattern_gen(pp
->patterns
, 0, src
[i
], 9, fixed_color
);
236 patterns_load(char src
[][11], int src_n
, char *filename
)
238 FILE *f
= fopen("moggy.patterns", "r");
239 if (!f
) return false;
242 for (i
= 0; i
< moggy_patterns_src_n
; i
++) {
244 if (!fgets(line
, sizeof(line
), f
))
246 int l
= strlen(line
);
247 if (l
!= 10 + (line
[l
- 1] == '\n'))
249 memcpy(src
[i
], line
, 10);
251 fprintf(stderr
, "moggy.patterns: %d patterns loaded\n", i
);
255 fprintf(stderr
, "Error loading moggy.patterns.\n");
261 patterns_init(struct playout_policy
*p
)
263 char src
[moggy_patterns_src_n
][11];
265 if (!patterns_load(src
, moggy_patterns_src_n
, "moggy.patterns")) {
266 /* Use default pattern set. */
267 for (int i
= 0; i
< moggy_patterns_src_n
; i
++)
268 strcpy(src
[i
], moggy_patterns_src
[i
]);
271 patterns_gen(p
, src
, moggy_patterns_src_n
);
275 /* Check if we match any pattern centered on given move. */
277 test_pattern_here(struct playout_policy
*p
, char *hashtable
,
278 struct board
*b
, struct move
*m
)
281 int x
= coord_x(m
->coord
, b
), y
= coord_y(m
->coord
, b
);
282 pat
|= (board_atxy(b
, x
- 1, y
- 1) << 14)
283 | (board_atxy(b
, x
, y
- 1) << 12)
284 | (board_atxy(b
, x
+ 1, y
- 1) << 10);
285 pat
|= (board_atxy(b
, x
- 1, y
) << 8)
286 | (board_atxy(b
, x
+ 1, y
) << 6);
287 pat
|= (board_atxy(b
, x
- 1, y
+ 1) << 4)
288 | (board_atxy(b
, x
, y
+ 1) << 2)
289 | (board_atxy(b
, x
+ 1, y
+ 1));
290 //fprintf(stderr, "(%d,%d) hashtable[%04x] = %d\n", x, y, pat, hashtable[pat]);
291 return (hashtable
[pat
] & m
->color
) && !is_bad_selfatari(b
, m
->color
, m
->coord
);
295 apply_pattern_here(struct playout_policy
*p
, char *hashtable
,
296 struct board
*b
, struct move
*m
, struct move_queue
*q
)
298 if (test_pattern_here(p
, hashtable
, b
, m
))
299 q
->move
[q
->moves
++] = m
->coord
;
302 /* Check if we match any pattern around given move (with the other color to play). */
304 apply_pattern(struct playout_policy
*p
, struct board
*b
, struct move
*m
, struct move
*mm
)
306 struct moggy_policy
*pp
= p
->data
;
310 /* Suicides do not make any patterns and confuse us. */
311 if (board_at(b
, m
->coord
) == S_NONE
|| board_at(b
, m
->coord
) == S_OFFBOARD
)
314 foreach_neighbor(b
, m
->coord
, {
315 struct move m2
; m2
.coord
= c
; m2
.color
= stone_other(m
->color
);
316 if (board_is_valid_move(b
, &m2
))
317 apply_pattern_here(p
, pp
->patterns
, b
, &m2
, &q
);
319 foreach_diag_neighbor(b
, m
->coord
) {
320 struct move m2
; m2
.coord
= c
; m2
.color
= stone_other(m
->color
);
321 if (board_is_valid_move(b
, &m2
))
322 apply_pattern_here(p
, pp
->patterns
, b
, &m2
, &q
);
323 } foreach_diag_neighbor_end
;
325 if (mm
) { /* Second move for pattern searching */
326 foreach_neighbor(b
, mm
->coord
, {
327 if (coord_is_8adjecent(m
->coord
, c
, b
))
329 struct move m2
; m2
.coord
= c
; m2
.color
= stone_other(m
->color
);
330 if (board_is_valid_move(b
, &m2
))
331 apply_pattern_here(p
, pp
->patterns
, b
, &m2
, &q
);
333 foreach_diag_neighbor(b
, mm
->coord
) {
334 if (coord_is_8adjecent(m
->coord
, c
, b
))
336 struct move m2
; m2
.coord
= c
; m2
.color
= stone_other(m
->color
);
337 if (board_is_valid_move(b
, &m2
))
338 apply_pattern_here(p
, pp
->patterns
, b
, &m2
, &q
);
339 } foreach_diag_neighbor_end
;
343 fprintf(stderr
, "Pattern candidate moves: ");
344 for (int i
= 0; i
< q
.moves
; i
++) {
345 fprintf(stderr
, "%s ", coord2sstr(q
.move
[i
], b
));
347 fprintf(stderr
, "\n");
350 int i
= fast_random(q
.moves
);
351 return q
.moves
? q
.move
[i
] : pass
;
356 /* Is this ladder breaker friendly for the one who catches ladder. */
358 ladder_catcher(struct board
*b
, int x
, int y
, enum stone laddered
)
360 enum stone breaker
= board_atxy(b
, x
, y
);
361 return breaker
== stone_other(laddered
) || breaker
== S_OFFBOARD
;
365 ladder_catches(struct playout_policy
*p
, struct board
*b
, coord_t coord
, group_t laddered
)
367 struct moggy_policy
*pp
= p
->data
;
369 /* This is very trivial and gets a lot of corner cases wrong.
370 * We need this to be just very fast. One important point is
371 * that we sometimes might not notice a ladder but if we do,
372 * it should always work; thus we can use this for strong
373 * negative hinting safely. */
375 enum stone lcolor
= board_at(b
, group_base(laddered
));
376 int x
= coord_x(coord
, b
), y
= coord_y(coord
, b
);
379 fprintf(stderr
, "ladder check - does %s play out %s's laddered group %s?\n",
380 coord2sstr(coord
, b
), stone2str(lcolor
), coord2sstr(laddered
, b
));
382 /* First, special-case first-line "ladders". This is a huge chunk
383 * of ladders we actually meet and want to play. */
384 if (pp
->borderladders
385 && neighbor_count_at(b
, coord
, S_OFFBOARD
) == 1
386 && neighbor_count_at(b
, coord
, lcolor
) == 1) {
388 fprintf(stderr
, "border ladder\n");
389 /* Direction along border; xd is horiz. border, yd vertical. */
391 if (board_atxy(b
, x
+ 1, y
) == S_OFFBOARD
|| board_atxy(b
, x
- 1, y
) == S_OFFBOARD
)
395 /* Direction from the border; -1 is above/left, 1 is below/right. */
396 int dd
= (board_atxy(b
, x
+ yd
, y
+ xd
) == S_OFFBOARD
) ? 1 : -1;
398 fprintf(stderr
, "xd %d yd %d dd %d\n", xd
, yd
, dd
);
404 /* This is normally caught, unless we have friends both above
406 if (board_atxy(b
, x
+ xd
* 2, y
+ yd
* 2) == lcolor
407 && board_atxy(b
, x
- xd
* 2, y
- yd
* 2) == lcolor
)
409 /* ...or can't block where we need because of shortage
411 int libs1
= board_group_info(b
, group_atxy(b
, x
+ xd
- yd
* dd
, y
+ yd
- xd
* dd
)).libs
;
412 int libs2
= board_group_info(b
, group_atxy(b
, x
- xd
- yd
* dd
, y
- yd
- xd
* dd
)).libs
;
414 fprintf(stderr
, "libs1 %d libs2 %d\n", libs1
, libs2
);
415 if (libs1
< 2 && libs2
< 2)
417 if (board_atxy(b
, x
+ xd
* 2, y
+ yd
* 2) == lcolor
&& libs1
< 3)
419 if (board_atxy(b
, x
- xd
* 2, y
- yd
* 2) == lcolor
&& libs2
< 3)
427 /* Figure out the ladder direction */
429 xd
= board_atxy(b
, x
+ 1, y
) == S_NONE
? 1 : board_atxy(b
, x
- 1, y
) == S_NONE
? -1 : 0;
430 yd
= board_atxy(b
, x
, y
+ 1) == S_NONE
? 1 : board_atxy(b
, x
, y
- 1) == S_NONE
? -1 : 0;
434 fprintf(stderr
, "no ladder, too little space; self-atari?\n");
438 /* For given (xd,yd), we have two possibilities where to move
439 * next. Consider (-1,-1):
444 bool horiz_first
= ladder_catcher(b
, x
, y
- yd
, lcolor
); // left case
445 bool vert_first
= ladder_catcher(b
, x
- xd
, y
, lcolor
); // right case
447 /* We don't have to look at the other 'X' in the position - if it
448 * wouldn't be there, the group wouldn't be in atari. */
450 /* We do only tight ladders, not loose ladders. Furthermore,
451 * the ladders need to be simple:
453 * c O X supported . c O unsupported
456 assert(!(horiz_first
&& vert_first
));
457 if (!horiz_first
&& !vert_first
) {
458 /* TODO: In case of basic non-simple ladder, play out both variants. */
460 fprintf(stderr
, "non-simple ladder\n");
464 /* We do that below for further moves, but now initially - check
465 * that at 'c', we aren't putting any of the catching stones
467 #if 1 // this might be broken?
468 #define check_catcher_danger(b, x_, y_) do { \
469 if (board_atxy(b, (x_), (y_)) != S_OFFBOARD \
470 && board_group_info(b, group_atxy(b, (x_), (y_))).libs <= 2) { \
472 fprintf(stderr, "ladder failed - atari at the beginning\n"); \
477 check_catcher_danger(b
, x
, y
- yd
);
478 check_catcher_danger(b
, x
- xd
, y
+ yd
);
480 check_catcher_danger(b
, x
- xd
, y
);
481 check_catcher_danger(b
, x
+ xd
, y
- yd
);
483 #undef check_catcher_danger
486 #define ladder_check(xd1_, yd1_, xd2_, yd2_, xd3_, yd3_) \
487 if (board_atxy(b, x, y) != S_NONE) { \
488 /* Did we hit a stone when playing out ladder? */ \
489 if (ladder_catcher(b, x, y, lcolor)) \
490 return true; /* ladder works */ \
491 if (board_group_info(b, group_atxy(b, x, y)).lib[0] > 0) \
492 return false; /* friend that's not in atari himself */ \
494 /* No. So we are at new position. \
495 * We need to check indirect ladder breakers. */ \
497 * . x o O 1 <- only at O we can check for o at 2 \
498 * x o o x . otherwise x at O would be still deadly \
500 * We check for o and x at 1, these are vital. \
501 * We check only for o at 2; x at 2 would mean we \
502 * need to fork (one step earlier). */ \
503 coord_t c1 = coord_xy(b, x + (xd1_), y + (yd1_)); \
504 enum stone s1 = board_at(b, c1); \
505 if (s1 == lcolor) return false; \
506 if (s1 == stone_other(lcolor)) { \
507 /* One more thing - if the position at 3 is \
508 * friendly and safe, we escaped anyway! */ \
509 coord_t c3 = coord_xy(b, x + (xd3_), y + (yd3_)); \
510 return board_at(b, c3) != lcolor \
511 || board_group_info(b, group_at(b, c3)).libs < 2; \
513 enum stone s2 = board_atxy(b, x + (xd2_), y + (yd2_)); \
514 if (s2 == lcolor) return false; \
515 /* Then, can X actually "play" 1 in the ladder? */ \
516 if (neighbor_count_at(b, c1, lcolor) + neighbor_count_at(b, c1, S_OFFBOARD) >= 2) \
517 return false; /* It would be self-atari! */ \
519 #define ladder_horiz do { if (PLDEBUGL(6)) fprintf(stderr, "%d,%d horiz step (%d,%d)\n", x, y, xd, yd); x += xd; ladder_check(xd, 0, -2 * xd, yd, 0, yd); } while (0)
520 #define ladder_vert do { if (PLDEBUGL(6)) fprintf(stderr, "%d,%d vert step of (%d,%d)\n", x, y, xd, yd); y += yd; ladder_check(0, yd, xd, -2 * yd, xd, 0); } while (0)
522 if (ladder_catcher(b
, x
- xd
, y
, lcolor
))
532 can_be_captured(struct playout_policy
*p
, struct board
*b
, enum stone capturer
, coord_t c
, enum stone to_play
)
534 if (board_at(b
, c
) != stone_other(capturer
)
535 || board_group_info(b
, group_at(b
, c
)).libs
> 1)
538 coord_t capture
= board_group_info(b
, group_at(b
, c
)).lib
[0];
540 fprintf(stderr
, "can capture group %d (%s)?\n",
541 group_at(b
, c
), coord2sstr(capture
, b
));
542 struct move m
; m
.color
= to_play
; m
.coord
= capture
;
543 /* Does that move even make sense? */
544 if (!board_is_valid_move(b
, &m
))
546 /* Make sure capturing the group will actually
548 else if (is_bad_selfatari(b
, to_play
, capture
))
555 can_be_rescued(struct playout_policy
*p
, struct board
*b
, group_t group
, enum stone color
, coord_t lib
)
557 /* Does playing on the liberty rescue the group? */
558 if (!is_bad_selfatari(b
, color
, lib
))
561 /* Then, maybe we can capture one of our neighbors? */
562 foreach_in_group(b
, group
) {
563 foreach_neighbor(b
, c
, {
564 if (!is_pass(can_be_captured(p
, b
, color
, c
, color
)))
567 } foreach_in_group_end
;
572 group_atari_check(struct playout_policy
*p
, struct board
*b
, group_t group
, enum stone to_play
, struct move_queue
*q
)
574 int qmoves_prev
= q
->moves
;
576 /* We don't use @to_play almost anywhere since any moves here are good
577 * for both defender and attacker. */
579 enum stone color
= board_at(b
, group_base(group
));
580 coord_t lib
= board_group_info(b
, group
).lib
[0];
582 assert(color
!= S_OFFBOARD
&& color
!= S_NONE
);
584 fprintf(stderr
, "[%s] atariiiiiiiii %s of color %d\n", coord2sstr(group
, b
), coord2sstr(lib
, b
), color
);
585 assert(board_at(b
, lib
) == S_NONE
);
587 /* Do not bother with kos. */
588 if (group_is_onestone(b
, group
)
589 && neighbor_count_at(b
, lib
, color
) + neighbor_count_at(b
, lib
, S_OFFBOARD
) == 4)
592 /* Can we capture some neighbor? */
593 foreach_in_group(b
, group
) {
594 foreach_neighbor(b
, c
, {
595 coord_t capture
= can_be_captured(p
, b
, color
, c
, to_play
);
596 if (is_pass(capture
))
599 q
->move
[q
->moves
++] = capture
;
602 } foreach_in_group_end
;
604 struct move m
; m
.color
= to_play
; m
.coord
= lib
;
605 if (!board_is_valid_move(b
, &m
))
608 /* Do not suicide... */
609 if (is_bad_selfatari(b
, to_play
, lib
))
611 /* Do not remove group that cannot be saved by the opponent. */
612 if (to_play
!= color
&& !can_be_rescued(p
, b
, group
, color
, lib
))
615 fprintf(stderr
, "...escape route valid\n");
617 /* ...or play out ladders. */
618 if (ladder_catches(p
, b
, lib
, group
)) {
622 fprintf(stderr
, "...no ladder\n");
624 if (to_play
!= color
) {
625 /* We are the attacker! In that case, throw away the moves
626 * that defend our groups, since we can capture the culprit. */
627 q
->moves
= qmoves_prev
;
630 q
->move
[q
->moves
++] = lib
;
635 global_atari_check(struct playout_policy
*p
, struct board
*b
, enum stone to_play
)
643 int g_base
= fast_random(b
->clen
);
644 for (int g
= g_base
; g
< b
->clen
; g
++) {
645 group_atari_check(p
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, &q
);
647 return q
.move
[fast_random(q
.moves
)];
649 for (int g
= 0; g
< g_base
; g
++) {
650 group_atari_check(p
, b
, group_at(b
, group_base(b
->c
[g
])), to_play
, &q
);
652 return q
.move
[fast_random(q
.moves
)];
658 local_atari_check(struct playout_policy
*p
, struct board
*b
, struct move
*m
)
663 /* Did the opponent play a self-atari? */
664 if (board_group_info(b
, group_at(b
, m
->coord
)).libs
== 1) {
665 group_atari_check(p
, b
, group_at(b
, m
->coord
), stone_other(m
->color
), &q
);
668 foreach_neighbor(b
, m
->coord
, {
669 group_t g
= group_at(b
, c
);
670 if (!g
|| board_group_info(b
, g
).libs
!= 1)
672 group_atari_check(p
, b
, g
, stone_other(m
->color
), &q
);
676 fprintf(stderr
, "Local atari candidate moves: ");
677 for (int i
= 0; i
< q
.moves
; i
++) {
678 fprintf(stderr
, "%s ", coord2sstr(q
.move
[i
], b
));
680 fprintf(stderr
, "\n");
683 int i
= fast_random(q
.moves
);
684 return q
.moves
? q
.move
[i
] : pass
;
688 playout_moggy_choose(struct playout_policy
*p
, struct board
*b
, enum stone to_play
)
690 struct moggy_policy
*pp
= p
->data
;
694 board_print(b
, stderr
);
697 if (!is_pass(b
->last_move
.coord
)) {
698 /* Local group in atari? */
699 if (pp
->lcapturerate
> fast_random(100)) {
700 c
= local_atari_check(p
, b
, &b
->last_move
);
705 /* Check for patterns we know */
706 if (pp
->patternrate
> fast_random(100)) {
707 c
= apply_pattern(p
, b
, &b
->last_move
,
708 pp
->pattern2
&& b
->last_move2
.coord
>= 0 ? &b
->last_move2
: NULL
);
716 /* Any groups in atari? */
717 if (pp
->capturerate
> fast_random(100)) {
718 c
= global_atari_check(p
, b
, to_play
);
724 int fbtries
= b
->flen
/ 8;
725 for (int i
= 0; i
< (fbtries
< pp
->fillboardtries
? fbtries
: pp
->fillboardtries
); i
++) {
726 coord_t c
= b
->f
[fast_random(b
->flen
)];
727 if (immediate_liberty_count(b
, c
) == 4)
729 /* XXX: We ignore stones placed diagonally. */
736 assess_local_bonus(struct playout_policy
*p
, struct board
*board
, struct move
*a
, struct move
*b
, int games
)
738 struct moggy_policy
*pp
= p
->data
;
739 if (!pp
->assess_local
)
742 int dx
= abs(coord_x(a
->coord
, board
) - coord_x(b
->coord
, board
));
743 int dy
= abs(coord_y(a
->coord
, board
) - coord_y(b
->coord
, board
));
744 /* adjecent move, directly or diagonally? */
745 if (dx
+ dy
<= 1 + (dx
&& dy
))
752 playout_moggy_assess(struct playout_policy
*p
, struct board
*b
, struct move
*m
, int games
)
754 struct moggy_policy
*pp
= p
->data
;
756 if (is_pass(m
->coord
) || !board_is_valid_move(b
, m
))
760 fprintf(stderr
, "ASSESS of %s:\n", coord2sstr(m
->coord
, b
));
761 board_print(b
, stderr
);
764 /* Are we dealing with atari? */
765 if (pp
->lcapturerate
|| pp
->capturerate
) {
768 foreach_neighbor(b
, m
->coord
, {
769 group_t g
= group_at(b
, c
);
770 if (!g
|| board_group_info(b
, g
).libs
!= 1)
773 /* _Never_ play here if this move plays out
774 * a caught ladder. (Unless it captures another
776 if (pp
->ladderassess
&& ladder_catches(p
, b
, m
->coord
, g
)) {
777 /* Note that the opposite is not guarded against;
778 * we do not advise against capturing a laddered
779 * group (but we don't encourage it either). Such
780 * a move can simplify tactical situations if we
782 if (m
->color
== board_at(b
, c
))
787 struct move_queue q
; q
.moves
= 0;
788 group_atari_check(p
, b
, g
, m
->color
, &q
);
790 if (q
.move
[q
.moves
] == m
->coord
) {
792 fprintf(stderr
, "1.0: atari\n");
793 return assess_local_bonus(p
, b
, &b
->last_move
, m
, games
) * 2;
799 fprintf(stderr
, "0.0: ladder\n");
804 /* Is this move a self-atari? */
805 if (pp
->selfatarirate
) {
806 if (is_bad_selfatari(b
, m
->color
, m
->coord
)) {
808 fprintf(stderr
, "0.0: self-atari\n");
814 if (pp
->patternrate
) {
815 if (test_pattern_here(p
, pp
->patterns
, b
, m
)) {
817 fprintf(stderr
, "1.0: pattern\n");
818 return assess_local_bonus(p
, b
, &b
->last_move
, m
, games
);
826 playout_moggy_permit(struct playout_policy
*p
, struct board
*b
, struct move
*m
)
828 struct moggy_policy
*pp
= p
->data
;
830 /* The idea is simple for now - never allow self-atari moves.
831 * They suck in general, but this also permits us to actually
832 * handle seki in the playout stage. */
834 if (fast_random(100) >= pp
->selfatarirate
) {
836 fprintf(stderr
, "skipping sar test\n");
839 bool selfatari
= is_bad_selfatari(b
, m
->color
, m
->coord
);
840 if (PLDEBUGL(5) && selfatari
)
841 fprintf(stderr
, "__ Prohibiting self-atari %s %s\n",
842 stone2str(m
->color
), coord2sstr(m
->coord
, b
));
847 struct playout_policy
*
848 playout_moggy_init(char *arg
)
850 struct playout_policy
*p
= calloc(1, sizeof(*p
));
851 struct moggy_policy
*pp
= calloc(1, sizeof(*pp
));
853 p
->choose
= playout_moggy_choose
;
854 p
->assess
= playout_moggy_assess
;
855 p
->permit
= playout_moggy_permit
;
859 pp
->lcapturerate
= pp
->capturerate
= pp
->patternrate
= pp
->selfatarirate
= -1;
861 pp
->ladders
= pp
->borderladders
= true;
862 pp
->ladderassess
= true;
865 char *optspec
, *next
= arg
;
868 next
+= strcspn(next
, ":");
869 if (*next
) { *next
++ = 0; } else { *next
= 0; }
871 char *optname
= optspec
;
872 char *optval
= strchr(optspec
, '=');
873 if (optval
) *optval
++ = 0;
875 if (!strcasecmp(optname
, "lcapturerate") && optval
) {
876 pp
->lcapturerate
= atoi(optval
);
877 } else if (!strcasecmp(optname
, "capturerate") && optval
) {
878 pp
->capturerate
= atoi(optval
);
879 } else if (!strcasecmp(optname
, "patternrate") && optval
) {
880 pp
->patternrate
= atoi(optval
);
881 } else if (!strcasecmp(optname
, "selfatarirate") && optval
) {
882 pp
->selfatarirate
= atoi(optval
);
883 } else if (!strcasecmp(optname
, "rate") && optval
) {
885 } else if (!strcasecmp(optname
, "fillboardtries")) {
886 pp
->fillboardtries
= atoi(optval
);
887 } else if (!strcasecmp(optname
, "ladders")) {
888 pp
->ladders
= optval
&& *optval
== '0' ? false : true;
889 } else if (!strcasecmp(optname
, "borderladders")) {
890 pp
->borderladders
= optval
&& *optval
== '0' ? false : true;
891 } else if (!strcasecmp(optname
, "ladderassess")) {
892 pp
->ladderassess
= optval
&& *optval
== '0' ? false : true;
893 } else if (!strcasecmp(optname
, "assess_local")) {
894 pp
->assess_local
= optval
&& *optval
== '0' ? false : true;
895 } else if (!strcasecmp(optname
, "pattern2")) {
896 pp
->pattern2
= optval
&& *optval
== '0' ? false : true;
898 fprintf(stderr
, "playout-moggy: Invalid policy argument %s or missing value\n", optname
);
902 if (pp
->lcapturerate
== -1) pp
->lcapturerate
= rate
;
903 if (pp
->capturerate
== -1) pp
->capturerate
= rate
;
904 if (pp
->patternrate
== -1) pp
->patternrate
= rate
;
905 if (pp
->selfatarirate
== -1) pp
->selfatarirate
= rate
;