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 条

[1] Monte-Carlo Tree Search for Logistics
Edelkamp, Stefan
Gath, Max
Greulich, Christoph
Humann, Malte
Herzog, Otthein
Lawo, Michael
COMMERCIAL TRANSPORT, 2016, : 427 - 440
[2] Monte-Carlo Tree Search Solver
Winands, Mark H. M.
Bjornsson, Yngvi
Saito, Jahn-Takeshi
COMPUTERS AND GAMES, 2008, 5131 : 25 - +
[3] Parallel Monte-Carlo Tree Search
Chaslot, Guillaume M. J. -B.
Winands, Mark H. M.
van den Herik, H. Jaap
COMPUTERS AND GAMES, 2008, 5131 : 60 - +
[4] Monte-Carlo Tree Search with Tree Shape Control
Marchenko, Oleksandr I.
Marchenko, Oleksii O.
2017 IEEE FIRST UKRAINE CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (UKRCON), 2017, : 812 - 817
[5] Monte-Carlo Tree Search: To MC or to DP?
Feldman, Zohar
Domshlak, Carmel
21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 321 - 326
[6] Monte-Carlo Tree Search for Constrained POMDPs
Lee, Jongmin
Kim, Geon-Hyeong
Poupart, Pascal
Kim, Kee-Eung
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
[7] Monte-Carlo Tree Search in Settlers of Catan
Szita, Istvan
Chaslot, Guillaume
Spronck, Pieter
ADVANCES IN COMPUTER GAMES, 2010, 6048 : 21 - +
[8] Monte-Carlo Tree Search for Policy Optimization
Ma, Xiaobai
Driggs-Campbell, Katherine
Zhang, Zongzhang
Kochenderfer, Mykel J.
PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 3116 - 3122
[9] Scalability and Parallelization of Monte-Carlo Tree Search
Bourki, Amine
Chaslot, Guillaume
Coulm, Matthieu
Danjean, Vincent
Doghmen, Hassen
Hoock, Jean-Baptiste
Herault, Thomas
Rimmel, Arpad
Teytaud, Fabien
Teytaud, Olivier
Vayssiere, Paul
Yu, Ziqin
COMPUTERS AND GAMES, 2011, 6515 : 48 - 58
[10] Improving Monte-Carlo Tree Search in Havannah
Lorentz, Richard J.
COMPUTERS AND GAMES, 2011, 6515 : 105 - 115

← 1 2 3 4 5 →