삼목 게임에서의 최선의 수순

서지정보

ㆍ발행기관 : 한국컴퓨터게임학회 ㆍ수록지정보 : 한국컴퓨터게임학회 논문지 / 27권 / 3호
ㆍ저자명 : 최영욱, 이병두

목차

ABSTRACT
1. 서론
2. 본론
2.1 몬테카를로 트리탐색
2.2 삼목 게임에 적용된 MCTS
3. 결론 및 제언
3.1 결론
3.2 제언
참고문헌

영어 초록

The game of Go is an oriental strategic board game originated from China at least more than 2,500 years ago. The Monte-Carlo Tree Search (MCTS) algorithm in Go is a method that uses a large number of simulations to approximately estimate the winning rate of candidate moves by sampling the game. The two computer Go programs called Crazy Stone and Mogo defeated human Go professionals on the 9⨯9 board in 2006. Prior to our implementing MCTS into computer Go, we tried to find out the best move sequence in playing Tic-Tac-Toe game as a test bed. The experimental results revealed that the first player should play the center to ensure the highest winning rate, and the game result becomes a draw if two players do their best.

참고 자료

없음