Abstract
This article presents a search-based approach of solving Go on small boards. A dedicated heuristic evaluation function combined with the static recognition of unconditional territory is used in an alpha-beta framework with several domain-dependent and domain-independent search enhancements. We present two variants of the GHI problem (caused by super-ko rules) with some possible solutions. Our program, MIGOS, solves all small empty square boards up to 5 x 5 and can be applied to any enclosed problem of similar size.
| Original language | English |
|---|---|
| Pages (from-to) | 92-107 |
| Journal | ICGA Journal |
| Volume | 26 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Jun 2003 |