몬테카를로 트리탐색을 활용한 초소형 바둑에서의 최상의 수순과 덤의 크기

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×2 Go game would be ended in a tie and the size of Komi should be 0 point; Meanwhile, in a 3×3 Go Black can always win the game and the size of Komi should be 9 points.