Score Bounded Monte-Carlo Tree Search

被引：0
|
作者：
Cazenave, Tristan [1 ]
Saffidine, Abdallah [1 ]
机构：
[1] Univ Paris 09, LAMSADE, Paris, France
来源：
COMPUTERS AND GAMES | 2011年 / 6515卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It is for example the case in games that can end in draw positions. In this case it improves significantly a MCTS solver to take into account bounds on the possible scores of a node in order to select the nodes to explore. We apply our algorithm to solving Seki in the game of Go and to Connect Four.
引用
收藏
页码：93 / 104
页数：12
相关论文
共 50 条
  • [41] Monte-Carlo Tree Search in Dragline Operation Planning
    Liu, Haoquan
    Austin, Kevin
    Forbes, Michael
    Kearney, Michael
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2018, 3 (01): : 419 - 425
  • [42] Single-Player Monte-Carlo Tree Search
    Schadd, Maarten P. D.
    Winands, Mark H. M.
    van den Herik, H. Jaap
    Chaslot, Guillaume M. J. -B.
    Uiterwijk, Jos W. H. M.
    COMPUTERS AND GAMES, 2008, 5131 : 1 - +
  • [43] Combining Monte-Carlo Tree Search with Proof-Number Search
    Doe, Elliot
    Winands, Mark H. M.
    Soemers, Dennis J. N. J.
    Browne, Cameron
    2022 IEEE CONFERENCE ON GAMES, COG, 2022, : 206 - 212
  • [44] Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search
    Ikeda, Kokolo
    Viennot, Simon
    COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 26 - 38
  • [45] Monte-Carlo Tree Search for the Game of "7Wonders"
    Robilliard, Denis
    Fonlupt, Cyril
    Teytaud, Fabien
    COMPUTER GAMES, CGW 2014, 2014, 504 : 64 - 77
  • [46] Efficient selectivity and backup operators in Monte-Carlo tree search
    Coulom, Remi
    COMPUTERS AND GAMES, 2007, 4630 : 72 - 83
  • [47] Monte-Carlo tree search for stable structures of planar clusters
    He Chang-Chun
    Liao Ji-Hai
    Yang Xiao-Bao
    ACTA PHYSICA SINICA, 2017, 66 (16)
  • [48] αβ-based Play-outs in Monte-Carlo Tree Search
    Winands, Mark H. M.
    Bjornsson, Yngvi
    2011 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 2011, : 110 - 117
  • [49] Pruning Playouts in Monte-Carlo Tree Search for the Game of Havannah
    Dugueperoux, Joris
    Mazyad, Ahmad
    Teytaud, Fabien
    Dehos, Julien
    COMPUTERS AND GAMES, CG 2016, 2016, 10068 : 47 - 57
  • [50] Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search
    Pepels, Tom
    Cazenave, Tristan
    Winands, Mark H. M.
    Lanctot, Marc
    COMPUTER GAMES, CGW 2014, 2014, 504 : 1 - 15
12345