• 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

UCD : Upper confidence bound for rooted directed acyclic graphs

Cazenave, Tristan; Méhat, Jean; Saffidine, Abdallah (2012), UCD : Upper confidence bound for rooted directed acyclic graphs, Knowledge-Based Systems, 34, p. 26-33. 10.1016/j.knosys.2011.11.014

View/Open
UCD _ Upper Confidence bound for rooted Directed acyclic graphs.pdf (470.7Kb)
Type
Article accepté pour publication ou publié
Date
2012
Journal name
Knowledge-Based Systems
Volume
34
Publisher
Elsevier
Pages
26-33
Publication identifier
10.1016/j.knosys.2011.11.014
Metadata
Show full item record
Author(s)
Cazenave, Tristan
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Méhat, Jean
Laboratoire d'Informatique Avancée de Saint-Denis [LIASD]
Saffidine, Abdallah
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In this paper we present a framework for testing various algorithms that deal with transpositions in Monte-Carlo Tree Search (MCTS). We call this framework Upper Confidence bound for Direct acyclic graphs (UCD) as it constitutes an extension of Upper Confidence bound for Trees (UCT) for Direct acyclic graphs (DAG).When using transpositions in MCTS, a DAG is progressively developed instead of a tree. There are multiple ways to handle the exploration exploitation dilemma when dealing with transpositions. We propose parameterized ways to compute the mean of the child, the playouts of the parent and the playouts of the child. We test the resulting algorithms on several games. For all games, original configurations of our algorithms improve on state of the art algorithms.
Subjects / Keywords
Monte-Carlo Tree Search; Transpositions; UCT Algorithm; Direct acyclic graph; Game tree search; Heuristic search

Related items

Showing items related by title and author.

  • Thumbnail
    UCD: Upper Confidence Bound for Rooted Directed Acyclic Graphs 
    Méhat, Jean; Cazenave, Tristan; Saffidine, Abdallah (2010) Communication / Conférence
  • Thumbnail
    Nested Monte Carlo Search for Two-Player Games 
    Cazenave, Tristan; Saffidine, Abdallah; Schofield, Michael John; Thielscher, Michael (2016) Communication / Conférence
  • Thumbnail
    A General Multi-Agent Modal Logic K Framework for Game Tree Search 
    Saffidine, Abdallah; Cazenave, Tristan (2012) 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é
  • Thumbnail
    Material Symmetry to Partition Endgame Tables 
    Buron, Cédric; Cazenave, Tristan; Jouandeau, Nicolas; Saffidine, Abdallah (2014) Communication / Conférence
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