Local move prediction in Go

25Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents a system that learns to predict local strong expert moves in the game of Go at a level comparable to that of strong human kyu players. This performance is achieved by four techniques. First, our training algorithm is based on a relative-target approach that avoids needless weight adaptations characteristic of most neural-network classifiers. Second, we reduce dimensionality through state-of-the-art feature extraction, and present two new feature-extraction methods, the Move Pair Analysis and the Modified Eigenspace Separation Transform. Third, informed pre-processing is used to reduce state-space complexity and to focus the feature extraction on important features. Fourth, we introduce and apply second-phase training, i.e., the retraining of the trained network with an augmented input constituting all pre-processed features. Experiments suggest that local move prediction will be a significant factor in enhancing the strength of Go programs. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Van Der Werf, E., Uiterwijk, J. W. H. M., Postma, E., & Van Den Herik, J. (2003). Local move prediction in Go. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2883, 393–412. https://doi.org/10.1007/978-3-540-40031-8_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free