SOLVING GO ON SMALL BOARDS

Article type: Research Article

Authors: van der Werf, Erik C. D. | van den Herik, H. Jaap | Uiterwijk, Jos W. H. M.^{; 1}

Affiliations: Maastricht, The Netherlands

Note: [1] Search and Games Group, IKAT, Department of Computer Science, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands. Email: {e.vanderwerf,herik,uiterwijk}@cs.unimaas.nl

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×5 and can be applied to any enclosed problem of similar size.

DOI: 10.3233/ICG-2003-26205

Journal: ICGA Journal, vol. 26, no. 2, pp. 92-107, 2003