static bool
test_useful_ladder(struct board *b, char *arg)
{
enum stone color = str2stone(arg);
arg += 2;
coord_t *cc = str2coord(arg, board_size(b));
coord_t c = *cc; coord_done(cc);
arg += strcspn(arg, " ") + 1;
int eres = atoi(arg);
board_print_test(2, b);
if (DEBUGL(1))
printf("useful_ladder %s %s %d...\t", stone2str(color), coord2sstr(c, b), eres);
assert(board_at(b, c) == S_NONE);
group_t atari_neighbor = board_get_atari_neighbor(b, c, color);
assert(atari_neighbor);
int ladder = is_ladder(b, c, atari_neighbor, true); assert(ladder);
int rres = useful_ladder(b, atari_neighbor);
if (rres == eres) {
if (DEBUGL(1))
printf("OK\n");
} else {
if (debug_level <= 2) {
board_print_test(0, b);
printf("useful_ladder %s %s %d...\t", stone2str(color), coord2sstr(c, b), eres);
}
printf("FAILED (%d)\n", rres);
}
return (rres == eres);
}
void
pattern_get(struct pattern_config *pc, struct pattern *p, struct board *b, struct move *m)
{
p->n = 0;
struct feature *f = &p->f[0];
/* TODO: We should match pretty much all of these features
* incrementally. */
/* FEAT_SPATIAL */
/* TODO */
assert(!pc->spat_max);
/* FEAT_PASS */
if (is_pass(m->coord)) {
f->id = FEAT_PASS; f->payload = 0;
f->payload |= (b->moves > 0 && is_pass(b->last_move.coord)) << PF_PASS_LASTPASS;
p->n++;
return;
}
/* FEAT_CAPTURE */
{
foreach_neighbor(b, m->coord, {
if (board_at(b, c) != stone_other(m->color))
continue;
group_t g = group_at(b, c);
if (!g || board_group_info(b, g).libs != 1)
continue;
/* Capture! */
f->id = FEAT_CAPTURE; f->payload = 0;
f->payload |= is_ladder(b, m->coord, g, true, true) << PF_CAPTURE_LADDER;
/* TODO: is_ladder() is too conservative in some
* very obvious situations, look at complete.gtp. */
/* TODO: PF_CAPTURE_RECAPTURE */
foreach_in_group(b, g) {
foreach_neighbor(b, c, {
assert(board_at(b, c) != S_NONE || c == m->coord);
if (board_at(b, c) != m->color)
continue;
group_t g = group_at(b, c);
if (!g || board_group_info(b, g).libs != 1)
continue;
/* A neighboring group of ours is in atari. */
f->payload |= 1 << PF_CAPTURE_ATARIDEF;
});
} foreach_in_group_end;
if (group_is_onestone(b, g)
&& neighbor_count_at(b, m->coord, stone_other(m->color))
+ neighbor_count_at(b, m->coord, S_OFFBOARD) == 4)
f->payload |= 1 << PF_CAPTURE_KO;
(f++, p->n++);
});
