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 条
  • [21] A Parallel Monte-Carlo Tree Search Algorithm
    Cazenave, Tristan
    Jouandeau, Nicolas
    [J]. COMPUTERS AND GAMES, 2008, 5131 : 72 - 80
  • [22] PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
    Chaslot, Guillaume M. J-B.
    Winands, Mark H. M.
    Van den Herik, H. Jaap
    Uiterwijk, Jos W. H. M.
    Bouzy, Bruno
    [J]. NEW MATHEMATICS AND NATURAL COMPUTATION, 2008, 4 (03) : 343 - 357
  • [23] LinUCB Applied to Monte-Carlo Tree Search
    Mandai, Yusaku
    Kaneko, Tomoyuki
    [J]. ADVANCES IN COMPUTER GAMES, ACG 2015, 2015, 9525 : 41 - 52
  • [24] Convex Regularization in Monte-Carlo Tree Search
    Dam, Tuan
    D'Eramo, Carlo
    Peters, Jan
    Pajarinen, Joni
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [25] The Multiple Uses of Monte-Carlo Tree Search
    Senington, Richard
    [J]. SPS 2022, 2022, 21 : 713 - 724
  • [26] Split Moves for Monte-Carlo Tree Search
    Kowalski, Jakub
    Mika, Maksymilian
    Pawlik, Wojciech
    Sutowicz, Jakub
    Szykula, Marek
    Winands, Mark H. M.
    [J]. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 10247 - 10255
  • [27] Multiple Tree for Partially Observable Monte-Carlo Tree Search
    Auger, David
    [J]. APPLICATIONS OF EVOLUTIONARY COMPUTATION, PT I, 2011, 6624 : 53 - 62
  • [28] Distributed Monte Carlo Tree Search: A Novel Technique and its Application to Computer Go
    Schaefers, Lars
    Platzner, Marco
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2015, 7 (04) : 361 - 374
  • [29] Evaluation of Monte Carlo Tree Search and the Application to Go
    Takeuchi, Shogo
    Kaneko, Tomoyuki
    Yamaguchi, Kazunori
    [J]. 2008 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND GAMES, 2008, : 191 - 198
  • [30] SDM-Go: an Agent for Go with an Improved Search Process Based on Monte-Carlo Tree Search and Sparse Distributed Memory
    Aguiar, Matheus Araujo
    Silva Julia, Rita Maria
    [J]. 2013 IEEE 16TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE 2013), 2013, : 424 - 431