Browse > Article
http://dx.doi.org/10.7583/JKGS.2017.17.3.63

The first move in the game of 9⨯9 Go, using non-strategic Monte-Carlo Tree Search  

Lee, Byung-Doo (Dept. of Baduk Studies, Division of Sports Science, Sehan University)
Publication Information
Journal of Korea Game Society / v.17, no.3, 2017 , pp. 63-70 More about this Journal
Abstract
In AI research Go is regarded as the most challenging board game due to the positional evaluation difficulty and the huge branching factor. MCTS is an exciting breakthrough to overcome these problems. The idea behind AlphaGo was to estimate the winning rate of a given position and then to lead deeper search for finding the best promising move. In this paper, using non-strategic MCTS we verified the fact that most pro players regard the best first move as Tengen (Origin of heaven) in $9{\times}9$ Go is correct. We also compared the average winning rates of the most popular first moves.
Keywords
$9{\times}9$ Go; position evaluation; branching factor; MCTS; first move; Tengen;
Citations & Related Records
Times Cited By KSCI : 5  (Citation Analysis)
연도 인용수 순위
1 Sensei's Library, "$9{\times}9$ Openings", from http://senseis.xmp.net/?9x9Openings, 2017.
2 S. Gelly, et al., "The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions", Communications of the ACM, Vol. 55, No. 3, pp. 106-113, 2012.   DOI
3 B.D. Lee, "Enhanced strategic Monte-Carlo Tree Search algorithm to play the game of Tic-Tac-Toe", Journal of Korea Game Society, Vol. 16, No. 4, pp. 79-86, 2016.   DOI
4 B.D. Lee, D.S. Park and Y.W. Choi, "The UCT algorithm applied to find the best first move in the game of Tic-Tac-Toe", Journal of Korea Game Society, Vol. 15, No. 5, pp. 109-118, 2015.   DOI
5 B.D. Lee, "Competition between MCTS and UCT in the game of Tic-Tac-Toe", Journal of Korean Society for Computer Game, Vol. 29, No. 1, pp. 1-6, 2016.   DOI
6 B.D. Lee, "Analysis of Tic-Tac-Toe Game Strategies using Genetic Algorithm", Journal of Korea Game Society, Vol. 14, No. 6, pp. 39-48, 2014.   DOI
7 B.D. Lee, "Monte-Carlo Tree Search Applied to the Game of Tic-Tac-Toe", Journal of Korea Game Society, Vol. 14, No. 3, pp. 47-54, 2014.   DOI
8 B.D. Lee and Y.W. Choi, "Monte-Carlo Game Implementation", Hansan Press, 2017.
9 A. Couetoux, M. Müller and O. Teytaud, "Monte Carlo Tree Search in Go", from https://webdocs.cs.ualberta.ca/-mmueller/ps/2013/2013-gochapter-preprint.pdf, 2017.
10 D. Silver, et al., "Mastering the game of Go with deep neural networks and tree search", Journal of Nature, Vol. 529, Issue 7587, pp. 484-489, 2016.   DOI
11 T. Song, "Monte Carlo Tree Search and Its Application in AlphaGo", from https://stlong0521.github.io/20160409%20-%20MCTS.html, 2017.
12 S.H. Jung, et al., "Modern Baduk theory", Dacom Press, 2016.
13 Wikipedia, "Komidashi", from https://en.wikipedia.org/wiki/Komidashi, 2017.
14 B.D. Lee, "Evolutionary neural network model for recognizing strategic fitness of a finished Tic-Tac-Toe game", Journal of Korean Society for Computer Game, Vol. 28, No. 2, pp. 95-101, 2015.
15 Wikipedia, "List of Go terms", from https://en.wikipedia.org/wiki/List_of_Go_terms
16 H. Baier and M.H.M. Winands, "Monte-carlo Tree Search and Minimax Hybrids", Computer Games, Vol. 504, pp. 45-63, 2014.
17 M.H.M. Winands and Y. Brornsson, "Evaluation Function Based Monte-Carlo LOA", from http://www.ru.is/-yngvi/pdf/WinandsB09.pdf, 2017.
18 A.A.J van der Kleij, "Monte Carlo Tree Search and Opponent Modeling through Player Clustering in no-limit Texas Hold'en Poker", Master thesis, University of Groningen, 2010.
19 E. Powley, et al, "Heuristic move pruning in monte carlo tree search for the strategic card game lords of war", In Computational Intelligence and Games (CIG) of IEEE, pp.1-7, 2014.
20 B.D. Lee, "Implementation of robust Tic-Tac-Toe game player, using enhanced Monte-Carlo algorithm", Journal of Korean Society for Computer Game, Vol. 26, No. 3, pp. 135-141, 2015.
21 B.D. Lee and Y.W. Choi, "The best move sequence in playing Tic-Tac-Toe game", Journal of The Korean Society for Computer Game, Vol. 27, No. 3, pp. 11-16, 2014.
22 B.D. Lee, "Comparison of LDA and PCA for Korean Pro Go Player's Opening Recognition", Journal of Korea Game Society, Vol. 13, No. 4, pp. 15-24, 2013.   DOI
23 B.D. Lee, "Analysis of Korean, Chinese and Japanese Pro Go Player's Openings", Journal of Korean Society for Computer Game, Vol. 26, No. 4, pp. 17-26, 2013.
24 B.D. Lee, "Korean Pro Go Player's Opening Recognition Using PCA", Journal of Korean Society for Computer Game, Vol. 26, No. 2, pp. 228-233, 2013.