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, M
Get full access to this article
View all access options for this article.