Show simple item record

dc.contributor.authorCazenave, Tristan*
dc.contributor.authorSaffidine, Abdallah*
dc.date.accessioned2014-08-26T14:03:18Z
dc.date.available2014-08-26T14:03:18Z
dc.date.issued2014
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/13836
dc.language.isoenen
dc.subjectabstract two-player games
dc.subject.ddc519en
dc.titleDevelopments on Product Propagation
dc.typeCommunication / Conférence
dc.description.abstractenProduct 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.
dc.identifier.citationpages257
dc.relation.ispartoftitleComputers and Games 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers
dc.relation.ispartofeditorVan den Herik, H.Jaap
dc.relation.ispartofpublnameSpringer
dc.relation.ispartofpublcityBerlin Heidelberg
dc.relation.ispartofdate2014
dc.subject.ddclabelProbabilités et mathématiques appliquéesen
dc.relation.ispartofisbn978-3-319-09164-8
dc.relation.conftitle8th International Conference on Computers and Games, CG 2013
dc.relation.confdate2013-08
dc.relation.confcityYokohama
dc.relation.confcountryJapan
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
dc.date.updated2017-01-23T09:50:49Z
hal.person.labIds989*
hal.person.labIds989*
hal.identifierhal-01497372*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record