• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

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

View/Open
score_bounded.PDF (169.1Kb)
Type
Communication / Conférence
Date
2011
Conference title
International Conference on Computers and Games 2010
Conference date
2010-09
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
Book author
Plaat, Aske; Iida, Hiroyuki; van den Herik, H. Jaap
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
6515
Published in
Berlin
ISBN
978-3-642-17927-3
Number of pages
277
Pages
93-104
Publication identifier
http://dx.doi.org/ 10.1007/978-3-642-17928-0_9
Metadata
Show full item record
Author(s)
Saffidine, Abdallah
Cazenave, Tristan
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.
Subjects / Keywords
Monte-Carlo tree search; MCTS solver

Related items

Showing items related by title and author.

  • Thumbnail
    Monte-Carlo Hex 
    Cazenave, Tristan; Saffidine, Abdallah (2010) Communication / Conférence
  • Thumbnail
    Utilisation de la recherche arborescente Monte-Carlo au Hex 
    Cazenave, Tristan; Saffidine, Abdallah (2009) Article accepté pour publication ou publié
  • Thumbnail
    Nested Monte Carlo Search for Two-Player Games 
    Cazenave, Tristan; Saffidine, Abdallah; Schofield, Michael John; Thielscher, Michael (2016) Communication / Conférence
  • Thumbnail
    Parallel Nested Monte-Carlo search 
    Jouandeau, Nicolas; Cazenave, Tristan (2009) Communication / Conférence
  • Thumbnail
    Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing 
    Méhat, Jean; Cazenave, Tristan (2010) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo