Learning to score final positions in the game of Go

This article investigates the application of machine-learning techniques for the task of scoring final positions in the game of Go. Neural network classifiers are trained to classify life and death from labelled 9 × 9 game records. The performance is compared to standard classifiers from statistical pattern recognition. A recursive framework for classification is used to improve performance iteratively. Using a maximum of four iterations our cascaded scoring architecture (CSA*) scores 98.9% of the positions correctly. Nearly all incorrectly scored positions are recognised (they can be corrected by a human operator). By providing reliable score information CSA* opens the large source of Go knowledge implicitly available in human game records for automatic extraction. It thus paves the way for a successful application of machine learning in Go.

[1]  Terrence J. Sejnowski,et al.  Temporal Difference Learning of Position Evaluation in the Game of Go , 1993, NIPS.

[2]  Fredrik A. Dahl,et al.  Honte, a go-playing program using neural nets , 2001 .

[3]  Gerald Tesauro,et al.  Temporal difference learning and TD-Gammon , 1995, CACM.

[4]  Martin Müller,et al.  Computer Go , 2002, Artif. Intell..

[5]  H. Jaap van den Herik,et al.  Learning to predict life and death from Go game records , 2005, Inf. Sci..

[6]  Bruno Bouzy,et al.  Computer Go: An AI oriented survey , 2001, Artif. Intell..

[7]  Anil K. Jain,et al.  Statistical Pattern Recognition: A Review , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  M. Enzenberger The Integration of A Priori Knowledge into a Go Playing Neural Network , 1996 .

[9]  Robert P.W. Duin,et al.  PRTools3: A Matlab Toolbox for Pattern Recognition , 2000 .

[10]  H. Jaap van den Herik,et al.  Learning to Estimate Potential Territory in the Game of Go , 2004, Computers and Games.

[11]  John Michael Robson,et al.  The Complexity of Go , 1983, IFIP Congress.

[12]  Ken Chen,et al.  Static Analysis of Life and Death in the Game of Go , 1999, Inf. Sci..

[13]  David Fotland Static Eye Analysis in "The Many Faces of Go" , 2002, J. Int. Comput. Games Assoc..

[14]  H. Jaap van den Herik,et al.  Complexity Starts at Five , 1987, J. Int. Comput. Games Assoc..

[15]  Eric O. Postma,et al.  Local Move Prediction in Go , 2002, Computers and Games.

[16]  David Lichtenstein,et al.  GO Is Polynomial-Space Hard , 1980, JACM.

[17]  Bob Myers THE 21st CENTURY CHAMPIONSHIP CUP 2002 , 2002 .

[18]  David B. Benson,et al.  Life in the game of Go , 1976 .

[19]  H. Jaap van den Herik,et al.  Solving Go on Small Boards , 2003, J. Int. Comput. Games Assoc..

[20]  Johannes Fürnkranz,et al.  Machines that learn to play games , 2001 .

[21]  Herbert D. Enderton The Golem Go Program , 1991 .