Monte-Carlo Tree Search Parallelisation for Computer Go

被引:0
|
作者
van Niekerk, Francois [1 ]
Kroon, Steve [2 ]
van Rooyen, Gert-Jan [1 ]
Inggs, Cornelia P. [2 ]
机构
[1] Univ Stellenbosch, E&E Engn Dept, ZA-7602 Matieland, South Africa
[2] Stellenbosch Univ, Comp Sci Div, ZA-7602 Matieland, South Africa
基金
新加坡国家研究基金会;
关键词
Monte-Carlo Tree Search; Computer Go; parallelisation;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Parallelisation of computationally expensive algorithms, such as Monte-Carlo Tree Search (MCTS), has become increasingly important in order to increase algorithm performance by making use of commonplace parallel hardware. Oakfoam, an MCTS-based Computer Go player, was extended to support parallel processing on multi-core and cluster systems. This was done using tree parallelisation for multi-core systems and root parallelisation for cluster systems. Multi-core parallelisation scaled linearly on the tested hardware on 9x9 and 19x19 boards when using the virtual loss modification. Cluster parallelisation showed poor results on 9x9 boards, but scaled well on 19x19 boards, where it achieved a four-node ideal strength increase on eight nodes. Due to this work, Oakfoam is currently one of only two open-source MCTS-based Computer Go players with cluster parallelisation, and the only one using the Message Passing Interface (MPI) standard.
引用
收藏
页码:129 / 138
页数:10
相关论文
共 50 条
  • [1] Application of Monte-Carlo Tree Search in Tsumego of Computer Go
    Wang, Fang
    Peng, Ying
    [J]. MEASUREMENT TECHNOLOGY AND ITS APPLICATION, PTS 1 AND 2, 2013, 239-240 : 1344 - 1347
  • [2] Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go
    Huang, Shih-Chieh
    Mueller, Martin
    [J]. COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 39 - +
  • [3] Monte-Carlo tree search and rapid action value estimation in computer Go
    Gelly, Sylvain
    Silver, David
    [J]. ARTIFICIAL INTELLIGENCE, 2011, 175 (11) : 1856 - 1875
  • [4] Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go
    Fernando, Sumudu
    Mueller, Martin
    [J]. COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 72 - 83
  • [5] Monte-Carlo proof-number search for computer Go
    Saito, Jahn-Takeshi
    Chaslot, Guillaume
    Uiterwijk, Jos W. H. M.
    van den Herik, H. Jaap
    [J]. COMPUTERS AND GAMES, 2007, 4630 : 50 - +
  • [6] Time Management for Monte-Carlo Tree Search Applied to the Game of Go
    Huang, Shih-Chieh
    Coulom, Remi
    Lin, Shun-Shii
    [J]. INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2010), 2010, : 462 - 466
  • [7] Monte-Carlo Tree Search for Logistics
    Edelkamp, Stefan
    Gath, Max
    Greulich, Christoph
    Humann, Malte
    Herzog, Otthein
    Lawo, Michael
    [J]. COMMERCIAL TRANSPORT, 2016, : 427 - 440
  • [8] The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions
    Gelly, Sylvain
    Kocsis, Levente
    Schoenauer, Marc
    Sebag, Michele
    Silver, David
    Szepesvari, Csaba
    Teytaud, Olivier
    [J]. COMMUNICATIONS OF THE ACM, 2012, 55 (03) : 106 - 113
  • [9] Monte-Carlo Tree Search Solver
    Winands, Mark H. M.
    Bjornsson, Yngvi
    Saito, Jahn-Takeshi
    [J]. COMPUTERS AND GAMES, 2008, 5131 : 25 - +
  • [10] Parallel Monte-Carlo Tree Search
    Chaslot, Guillaume M. J. -B.
    Winands, Mark H. M.
    van den Herik, H. Jaap
    [J]. COMPUTERS AND GAMES, 2008, 5131 : 60 - +