Abstract
A position evaluation and a candidate-move-generation strategy for global selective search in Go are described. Moreover, some Go-specific enhancements to the basic global selective alpha-beta game-tree search procedure are discussed. Finally, empirical results on the performance of the enhancements are presented.
Get full access to this article
View all access options for this article.