Show simple item record

dc.contributor.authorMéhat, Jean
dc.contributor.authorCazenave, Tristan
dc.date.accessioned2010-11-19T08:22:09Z
dc.date.available2010-11-19T08:22:09Z
dc.date.issued2011
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5114
dc.language.isoenen
dc.subjectParallelizationen
dc.subjectMonte-Carlo tree searchen
dc.subjectGeneral Game Playingen
dc.subject.ddc006.3en
dc.titleA Parallel General Game Playeren
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe have parallelized our general game player Ary on a cluster of computers.We propose multiple parallelization algorithms. For the sake of simplicity all our algorithms have processes that run independently and that join their results at the end of the thinking time in order to choose a move. Parallelization works very well for checkers, quite well for other two player sequential move games and not at all for a few other games.en
dc.relation.isversionofjnlnameKI. Künstliche Intelligenz
dc.relation.isversionofjnlvol25
dc.relation.isversionofjnlissue1
dc.relation.isversionofjnldate2011
dc.relation.isversionofjnlpages43-47
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s13218-010-0083-6
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelIntelligence artificielleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record