Abstract
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 x 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.
Original language | English |
---|---|
Pages (from-to) | 168-183 |
Journal | Theoretical Computer Science |
Volume | 349 |
Issue number | 2 |
DOIs | |
Publication status | Published - 14 Dec 2005 |
Keywords
- Go
- learning
- neural net
- scoring
- game records
- life and death