삼목 게임에서의 최선의 수순
The best move sequence in playing Tic-Tac-Toe game
2
조회
0
다운로드
10
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (17)
- Monte-Carlo Tree Search, "G. Chaslot", Netherlands Organization for Scientific Research, 110~ (2010)
- S. Gelly, "Achieving Master Level Play in 9⨯9 Computer Go", Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008)
- 이병두, "삼목 게임에 적용된 몬테카를로 트리탐색", 한국게임학회 논문지, 14(3), pp.47~54 (2014), 한국게임학회[DOI]
- 이병두, "주성분분석을 통한 바둑 포석 분석", 한국게임학회 논문지, 13(2), pp.59~70 (2013), 한국게임학회[DOI]
- 이병두, "한중일 프로바둑기사 포석 분석", 한국컴퓨터게임학회논문지, 26(4), pp.17~26 (2013), (사)한국컴퓨터게임학회
- 이병두, "한국 프로바둑기사 포석 인식을 위한 선형판별분석과 주성분분석 비교", 한국게임학회 논문지, 13(4), pp.15~24 (2013), 한국게임학회[DOI]
- 이병두, "주성분분석을 활용한 한국 프로바둑기사 포석 인식", 한국컴퓨터게임학회논문지, 26(2), pp.73~80 (2013), (사)한국컴퓨터게임학회
- 이병두, "뉴로-퍼지 추론을 적용한 포석 바둑", 한국게임학회 논문지, 9(6), pp.117~126 (2009), 한국게임학회
- 이병두, "휴리스틱 세력 함수를 이용한 바둑 사활 문제의 눈 모양 분석", 한국컴퓨터게임학회논문지, 111(15), pp.111~117 (2008), (사)한국컴퓨터게임학회
- C. Pinaki, "Artificial Intelligence Based Strategies to Play the Tic-Tac-Toe Game", Journal of Technology and Engineering Science, 1(1), pp.62~69 (2009)
- "Monte-Carlo Method" (2014)[URL]
- "Evaluation Function Based Monte-Carlo LOA" (2014)[URL]
- "To win a tic tac toe game, what is the best first move?" (2014)[URL]
- "Winning tic-tac-toe Strategies" (2014)[URL]
- "How to Win at Tic-Tac-Toe" (2002)[URL]
- "Monte Carlo Tree Search in Borad Game AI" (2014)[URL]
- "The Educational Value of Tic-Tac-Toe for Four- to Six-Year-Olds" (2014)[URL]