References
- 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. https://doi.org/10.7583/JKGS.2016.16.4.79
- 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. https://doi.org/10.7583/JKGS.2015.15.5.109
- 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. https://doi.org/10.21493/kscg.2016.29.2.1
- 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. https://doi.org/10.7583/JKGS.2014.14.6.39
- 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. https://doi.org/10.7583/JKGS.2014.14.3.47
- B.D. Lee and Y.W. Choi, "Monte-Carlo Game Implementation", Hansan Press, 2017.
- 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.
- 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. https://doi.org/10.1038/nature16961
- T. Song, "Monte Carlo Tree Search and Its Application in AlphaGo", from https://stlong0521.github.io/20160409%20-%20MCTS.html, 2017.
- S.H. Jung, et al., "Modern Baduk theory", Dacom Press, 2016.
- Wikipedia, "Komidashi", from https://en.wikipedia.org/wiki/Komidashi, 2017.
- Wikipedia, "List of Go terms", from https://en.wikipedia.org/wiki/List_of_Go_terms
-
Sensei's Library, "
$9{\times}9$ Openings", from http://senseis.xmp.net/?9x9Openings, 2017. - H. Baier and M.H.M. Winands, "Monte-carlo Tree Search and Minimax Hybrids", Computer Games, Vol. 504, pp. 45-63, 2014.
- M.H.M. Winands and Y. Brornsson, "Evaluation Function Based Monte-Carlo LOA", from http://www.ru.is/-yngvi/pdf/WinandsB09.pdf, 2017.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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. https://doi.org/10.7583/JKGS.2013.13.4.15
- 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.
- 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.
- 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. https://doi.org/10.1145/2093548.2093574