Date
2011
Collection title
Lecture Notes in Computer Science
Collection Id
6515
Dewey
Intelligence artificielle
Sujet
Monte-Carlo tree search; MCTS solver
Conference name
International Conference on Computers and Games 2010
Conference date
09-2010
Conference city
Kanazawa
Conference country
Japon
Book title
Computers and Games
7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers
Author
Plaat, Aske; Iida, Hiroyuki; van den Herik, H. Jaap
Publisher
Springer
Publisher city
Berlin
Year
2011
Pages number
277
ISBN
978-3-642-17927-3
Author
Saffidine, Abdallah
Cazenave, Tristan
Type
Communication / Conférence
Item number of pages
93-104
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 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.
