원문정보
The best move sequence in playing Tic-Tac-Toe game
초록
영어
The game of Go is an oriental strategic board game originated from China at least more than 2,500years ago. The Monte-Carlo Tree Search (MCTS) algorithm in Go is a method that uses a large number ofsimulations to approximately estimate the winning rate of candidate moves by sampling the game. Thetwo computer Go programs called Crazy Stone and Mogo defeated human Go professionals on the 9⨯9board in 2006. Prior to our implementing MCTS into computer Go, we tried to find out the best movesequence in playing Tic-Tac-Toe game as a test bed. The experimental results revealed that the first playershould play the center to ensure the highest winning rate, and the game result becomes a draw if twoplayers do their best.
목차
1. 서론
2. 본론
2.1 몬테카를로 트리탐색
2.2 삼목 게임에 적용된 MCTS
3. 결론 및 제언
3.1 결론
3.2 제언
참고문헌
