The Survey of Methods and Algorithms for Computer Game Go

Computer go game is one of the most challenging research branches in the field of artificial intelligence and cognitive science. The success of AlphaGo has received worldwide attention on deep learning and computer go. In this paper, we present the survey of methods and algorithms for computer go game searching and situation evaluation according to the discussed literature in different development stages. This paper also gives the promising future research on the computer go.

[1]  Bruno Bouzy,et al.  Monte-Carlo Go Developments , 2003, ACG.

[2]  David Silver,et al.  Combining Online and Offline Learning in UCT , 2007 .

[3]  Yi Wang,et al.  Game Player Strategy Pattern Recognition and How UCT Algorithms Apply Pre-knowledge of Player's Strategy to Improve Opponent AI , 2008, 2008 International Conference on Computational Intelligence for Modelling Control & Automation.

[4]  T. Anthony Marsland,et al.  A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..

[5]  Yuandong Tian,et al.  Better Computer Go Player with Neural Network and Long-term Prediction , 2016, ICLR.

[6]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[7]  Albert L. Zobrist,et al.  A New Hashing Method with Application for Game Playing , 1990 .

[8]  Simon M. Lucas,et al.  A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[9]  Sylvain Gelly,et al.  Exploration exploitation in Go: UCT for Monte-Carlo Go , 2006, NIPS 2006.

[10]  Rémi Coulom,et al.  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

[11]  Bruno Bouzy,et al.  Move-Pruning Techniques for Monte-Carlo Go , 2006, ACG.

[12]  Albert L. Zobrist.  Complex preprocessing for pattern recognition , 1971, ACM '71.

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

[14]  David P. Helmbold,et al.  All-Moves-As-First Heuristics in Monte-Carlo Go , 2009, IC-AI.

[15]  David Silver,et al.  Monte-Carlo tree search and rapid action value estimation in computer Go , 2011, Artif. Intell..

[16]  Albert Lindsey Zobrist,et al.  Feature extraction and representation for pattern recognition and the game of go , 1970 .

[17]  Demis Hassabis,et al.  Mastering the game of Go with deep neural networks and tree search , 2016, Nature.

[18]  Xiali Li,et al.  A Multi-modal Searching Algorithm in Computer Go Based on Test , 2015 .

[19]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[20]  Keh-Hsun Chen,et al.  Dynamic randomization and domain knowledge in Monte-Carlo Tree Search for Go knowledge-based systems , 2012, Knowl. Based Syst..