Score Bounded Monte-Carlo Tree Search
Saffidine, Abdallah; Cazenave, Tristan (2011), Score Bounded Monte-Carlo Tree Search, in Plaat, Aske; Iida, Hiroyuki; van den Herik, H. Jaap, Computers and Games 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers, Springer : Berlin, p. 93-104
TypeCommunication / Conférence
Conference titleInternational Conference on Computers and Games 2010
Book titleComputers and Games 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers
Book authorPlaat, Aske; Iida, Hiroyuki; van den Herik, H. Jaap
Series titleLecture Notes in Computer Science
Number of pages277
MetadataShow full item record
Abstract (EN)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 signiﬁcantly 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.
Subjects / KeywordsMonte-Carlo tree search; MCTS solver
Showing items related by title and author.