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

• 영문명: The best move sequence in playing Tic-Tac-Toe game
• 발행기관: 한국컴퓨터게임학회
• 저자명: 최영욱(Young Wook Choi) 이병두(Byung Doo Lee)
• 간행물 정보: 『한국컴퓨터게임학회논문지』제27권 3호, 11~16쪽, 전체 6쪽
• 주제분류: 공학 > 컴퓨터학
• 파일형태: PDF
• 발행일자: 2014.09.30

영문 초록

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 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.

목차

1. 서론

2. 본론

3. 결론 및 제언

참고문헌

키워드

game of Go Monte-Carlo Tree Search MCTS Tic-Tac-Toe best move sequence