• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

UCD: Upper Confidence Bound for Rooted Directed Acyclic Graphs

Thumbnail
Date
2010
Dewey
Intelligence artificielle
Sujet
DAG; Transpositions; UCT; Monte-Carlo Tree Search
DOI
http://dx.doi.org/10.1109/TAAI.2010.79
Conference name
TAAI 2010
Conference date
11-2010
Conference city
Hsinchu City
Conference country
Taïwan
Book title
International Conference on Technologies and Applications of Artificial Intelligence
Publisher
IEEE
Year
2010
ISBN
978-1-4244-8668-7
URI
https://basepub.dauphine.fr/handle/123456789/6978
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Méhat, Jean
Cazenave, Tristan
Saffidine, Abdallah
Type
Communication / Conférence
Item number of pages
467-473
Abstract (EN)
In this paper we present a framework for testing various algorithms that deal with transpositions in Monte-Carlo Tree Search (MCTS). When using transpositions in MCTS, a Directed Acyclic Graph (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 LeftRight an abstract single player game and on Hex. For both games, original configurations of our algorithms improve on state of the art algorithms.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.