Go is an extremely complex strategic board game despite its simple rules. Recently computer Go based on MCTS plays at human-master level and also has defeated top professional players with handicap games in 19×19 Go. Before implementing computer Go, in this paper we show weakness of pure MC algorithm for playing robust Tic-Tac-Toe game and present alternative method to make up the weakness. Furthermore we show how UCB algorithm works for balancing exploration and exploitation in game tree and discuss the need of a hybrid algorithm combined with UCB and strategy based MCTS, for implementing an enhanced computer Go.

ABSTRACT
 1. 서론
 2. 관련연구
 3. 본론
  3.1 몬테카를로 트리탐색
  3.2 수학적 승률과 통계학적 승률
  3.3 탐험과 활용의 딜레마
 4. 결론 및 제언
  4.1 결론
  4.2 제언
 감사의 글
 참고문헌

• 이병두(Department of Baduk Studies, Division of Sports Science, Sehan University) | Byung-Doo Lee Correspondence to