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 条
  • [41] CROSS-ENTROPY FOR MONTE-CARLO TREE SEARCH
    Chaslot, Guillaume M. J. B.
    Winands, Mark H. M.
    Szita, Istvan
    van den Herik, H. Jaap
    [J]. ICGA JOURNAL, 2008, 31 (03) : 145 - 156
  • [42] Can Monte-Carlo Tree Search learn to sacrifice?
    Nathan Companez
    Aldeida Aleti
    [J]. Journal of Heuristics, 2016, 22 : 783 - 813
  • [43] Monte-Carlo Tree Search for the Game of Scotland Yard
    Nijssen, J. A. M.
    Winands, Mark H. M.
    [J]. 2011 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 2011, : 158 - 165
  • [44] Bayesian Optimization for Backpropagation in Monte-Carlo Tree Search
    Lim, Nengli
    Li, Yueqin
    [J]. ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2021, PT II, 2021, 12892 : 209 - 221
  • [45] Can Monte-Carlo Tree Search learn to sacrifice?
    Companez, Nathan
    Aleti, Aldeida
    [J]. JOURNAL OF HEURISTICS, 2016, 22 (06) : 783 - 813
  • [46] Monte-Carlo Tree Search for the Maximum Satisfiability Problem
    Goffinet, Jack
    Ramanujan, Raghuram
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, 2016, 9892 : 251 - 267
  • [47] Parallel Monte-Carlo Tree Search for HPC Systems
    Graf, Tobias
    Lorenz, Ulf
    Platzner, Marco
    Schaefers, Lars
    [J]. EURO-PAR 2011 PARALLEL PROCESSING, PT 2, 2011, 6853 : 365 - 376
  • [48] Using evaluation functions in Monte-Carlo Tree Search
    Lorentz, Richard
    [J]. THEORETICAL COMPUTER SCIENCE, 2016, 644 : 106 - 113
  • [49] Monte-Carlo tree search for Bayesian reinforcement learning
    Ngo Anh Vien
    Wolfgang Ertel
    Viet-Hung Dang
    TaeChoong Chung
    [J]. Applied Intelligence, 2013, 39 : 345 - 353
  • [50] Monte-Carlo tree search as regularized policy optimization
    Grill, Jean-Bastien
    Altche, Florent
    Tang, Yunhao
    Hubert, Thomas
    Valko, Michal
    Antonoglou, Ioannis
    Munos, Remi
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119