Solving Go on small boards

ECD van der Werf*, HJ van den Herik, JWHM Uiterwijk

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


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 languageEnglish
Pages (from-to)92-107
JournalICGA Journal
Issue number2
Publication statusPublished - Jun 2003

Cite this