The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments

被引:58
作者
Lee, Chang-Shing [1 ]
Wang, Mei-Hui [1 ]
Chaslot, Guillaume [2 ]
Hoock, Jean-Baptiste [3 ]
Rimmel, Arpad [3 ]
Teytaud, Olivier [3 ]
Tsai, Shang-Rong [4 ]
Hsu, Shun-Chin [4 ]
Hong, Tzung-Pei [5 ]
机构
[1] Natl Univ Tainan, Dept Comp Sci & Informat Engn, Tainan 70005, Taiwan
[2] Univ Maastricht, Dept Comp Sci, NL-6200 Maastricht, Netherlands
[3] Univ Paris 11, TAO, INRIA Saclay IDF, CNRS,Lri, F-91405 Orsay, France
[4] Chang Jung Christian Univ, Dept Informat Management, Tainan 71011, Taiwan
[5] Natl Univ Kaohsiung, Dept Comp Sci & Informat Engn, Kaohsiung 81148, Taiwan
关键词
Computational intelligence; computer Go; game; MoGo; Monte Carlo tree search (MCTS); CHECKERS; ONTOLOGY;
D O I
10.1109/TCIAIG.2009.2018703
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In order to promote computer Go and stimulate further development and research in the field, the event activities, Computational Intelligence Forum and World 9 x 9 Computer Go Championship, were held in Taiwan. This study focuses on the invited games played in the tournament Taiwanese Go Players Versus the Computer Program MoGo held at the National University of Tainan (NUTN), Tainan, Taiwan. Several Taiwanese Go players, including one 9-Dan (9D) professional Go player and eight amateur Go players, were invited by NUTN to play against MoGo from August 26 to October 4, 2008. The MoGo program combines all-moves-as-first (AMAF)/rapid action value estimation (RAVE) values, online "upper confidence tree (UCT)-like" values, offline values extracted from databases, and expert rules. Additionally, four properties of MoGo are analyzed including: 1) the weakness in corners, 2) the scaling over time, 3) the behavior in handicap games, and 4) the main strength of MoGo in contact fights. The results reveal that MoGo can reach the level of 3 Dan (3D) with: 1) good skills for fights, 2) weaknesses in corners, in particular, for "semeai" situations, and 3) weaknesses in favorable situations such as handicap games. It is hoped that the advances in AI and computational power will enable considerable progress in the field of computer Go, with the aim of achieving the same levels as computer Chess or Chinese Chess in the future.
引用
收藏
页码:73 / 89
页数:17
相关论文
共 42 条
  • [1] SINGULAR EXTENSIONS - ADDING SELECTIVITY TO BRUTE-FORCE SEARCHING
    ANANTHARAMAN, T
    CAMPBELL, MS
    HSU, FH
    [J]. ARTIFICIAL INTELLIGENCE, 1990, 43 (01) : 99 - 109
  • [2] [Anonymous], 2005, IEEE 2005 Symposium on Computational Intelligence in Games
  • [3] Audibert JY, 2007, LECT NOTES ARTIF INT, V4754, P150
  • [4] AUDIBERT JY, 2006, WORKSH ONL TRAD EXPL
  • [5] Finite-time analysis of the multiarmed bandit problem
    Auer, P
    Cesa-Bianchi, N
    Fischer, P
    [J]. MACHINE LEARNING, 2002, 47 (2-3) : 235 - 256
  • [6] AUGER A, ALGORITHMIC IN PRESS, DOI DOI 10.1007/S00453-008-9244-5
  • [7] The challenge of poker
    Billings, D
    Davidson, A
    Schaeffer, J
    Szafron, D
    [J]. ARTIFICIAL INTELLIGENCE, 2002, 134 (1-2) : 201 - 240
  • [8] Associating domain-dependent knowledge and Monte Carlo approaches within a Go program
    Bouzy, B
    [J]. INFORMATION SCIENCES, 2005, 175 (04) : 247 - 257
  • [9] Computer go: An AI oriented survey
    Bouzy, B
    Cazenave, T
    [J]. ARTIFICIAL INTELLIGENCE, 2001, 132 (01) : 39 - 103
  • [10] Brugmann Bernd., 1993, Monte Carlo Go