earticle

논문검색

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

원문정보

The best move sequence in playing Tic-Tac-Toe game

최영욱, 이병두

피인용수 : 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
 1. 서론
 2. 본론
  2.1 몬테카를로 트리탐색
  2.2 삼목 게임에 적용된 MCTS
 3. 결론 및 제언
  3.1 결론
  3.2 제언
 참고문헌

저자정보

  • 최영욱 Young-Wook Choi. Department of Baduk Studies, Division of Sports Science,
  • 이병두 Byung-Doo Lee. Department of Baduk Studies, Division of Sports Science,

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 기관로그인 시 무료 이용이 가능합니다.

      • 4,000원

      0개의 논문이 장바구니에 담겼습니다.