• 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

Developments on Product Propagation

Cazenave, Tristan; Saffidine, Abdallah (2014), Developments on Product Propagation, in Van den Herik, H.Jaap, Computers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers, Springer : Berlin Heidelberg, p. 257

View/Open
probabilitySearch.pdf (436.1Kb)
Type
Communication / Conférence
Date
2014
Conference title
8th International Conference on Computers and Games, CG 2013
Conference date
2013-08
Conference city
Yokohama
Conference country
Japan
Book title
Computers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers
Book author
Van den Herik, H.Jaap
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-319-09164-8
Pages
257
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]
Saffidine, Abdallah
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
Product Propagation (pp) is an algorithm to backup probabilistic evaluations for abstract two-player games. It was shown that pp could solve Go problems as efficiently as Proof Number Search (pns). In this paper, we exhibit three domains where, for generic non-optimized versions, pp performs better (see the nuances in the paper) than previously known algorithms for solving games. The compared approaches include alpha-beta search, pns, and Monte-Carlo Tree Search. We also extend pp to deal with its memory consumption and to improve its solving time.
Subjects / Keywords
abstract two-player games

Related items

Showing items related by title and author.

  • Thumbnail
    UCD : Upper confidence bound for rooted directed acyclic graphs 
    Cazenave, Tristan; Méhat, Jean; Saffidine, Abdallah (2012) 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
  • Thumbnail
    Nested Monte Carlo Search for Two-Player Games 
    Cazenave, Tristan; Saffidine, Abdallah; Schofield, Michael John; Thielscher, Michael (2016) Communication / Conférence
  • Thumbnail
    Solving breakthrough with Race Patterns and Job-Level Proof Number Search 
    Cazenave, Tristan; Jouandeau, Nicolas; Saffidine, Abdallah (2012) Communication / Conférence
  • Thumbnail
    Monte-Carlo Hex 
    Cazenave, Tristan; Saffidine, Abdallah (2010) 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