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

The Best Sequence of Moves and the Size of Komi on a Very Small Go Board, using Monte-Carlo Tree Search  

Lee, Byung-Doo (Department of Baduk Studies, Division of Sports Science, Sehan University)
Publication Information
Journal of Korea Game Society / v.18, no.5, 2018 , pp. 77-82 More about this Journal
Abstract
Go is the most complex board game in which the computer can not search all possible moves using an exhaustive search to find the best one. Prior to AlphaGo, all powerful computer Go programs have used the Monte-Carlo Tree Search (MCTS) to overcome the difficulty in positional evaluation and the very large branching factor in a game tree. In this paper, we tried to find the best sequence of moves using an MCTS on a very small Go board. We found that a $2{\times}2$ Go game would be ended in a tie and the size of Komi should be 0 point; Meanwhile, in a $3{\times}3$ Go Black can always win the game and the size of Komi should be 9 points.
Keywords
small Go; MCTS; sequence of moves;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 B.D. Lee, "The first move in the game of $9{\time}9$ Go, using non-strategic Monte-Carlo Tree Search", Journal of Korea Game Society, Vol. 17, No. 3, pp. 63-70, 2017.   DOI
2 B. Abramson, "The Expected-Outcome Model of Two-Player Games", PhD thesis, Columbia University, 1987.
3 B. Brugmann, "Monte Carlo Go", Technical report, Syracuse University, 1993.
4 R. Coulom, "The Monte-Carlo Revolution in Go", Japanese-French Frontiers of Science Symposium, 2008.
5 M. Enzenberger and M. Muller, "Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search", Technical report, University of Alberta, 2008.
6 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.
7 T. Song, "Monte Carlo Tree Search and Its Application in AlphaGo", from https://stlong0521.github.io/20160409%20-%20MCTS.html, 2017.
8 Sense's Library, "Small board Go", from https://senseis.xmp.net/?SmallBoardGo, 2018.
9 S.H. Jung, et al., "Modern Baduk theory", Dacom Press, 2016.
10 Wikipedia, "Komidashi", from https://en.wikipedia.org/wiki/Komidashi, 2018.
11 Wikipedia, "Scoring", from https://ko.wikipedia.org/wiki/%EA%B3%84%EA%B0%80, 2018.
12 Wikipedia, "Seki", from https://ko.wikipedia.org/wiki/%EB%B9%85_(%EB%B0%94%EB%91%91), 2018.
13 H. Baier and M.H.M. Winands, "Monte-carlo Tree Search and Minimax Hybrids", Computer Games, Vol. 504, pp. 45-63, 2014.
14 M.H.M. Winands and Y. Brornsson, "Evaluation Function Based Monte-Carlo LOA", from http://www.ru.is/-yngvi/pdf/WinandsB09.pdf, 2017.
15 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
16 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.