WoodStock : un programme-joueur générique
(2017) Revue d’intelligence artificielle — Vol. 31, n° 3, p. 281-310 (2017)
Files
ria17.pdf
Open Access - Adobe PDF
- 374.83 KB
Details
- Authors
- Abstract
- This article describes WoodStock, the first general game player modelling each game from the General Game Playing (GGP) by a stochastic constraint network (SCSP). Each action played is decided by the resolution of this last one by the algorithm MAC-UCB. After the translation of an instance described in Game Description Language (GDL) in a network representative of the state of the game at any time, WoodStock solves each state by the maintaining arc-consistency algorithm (MAC) iteratively guided by the bandit-based stochastic sampling (UCB) of the next states. Thanks to this algorithm, WoodStock is since March 2016, the leader of the GGP Tiltyard continuous tournament. Moreover, in its last version exploiting the game symmetries finding by the constraint symmetry detection, the search space associated with a game is significatively reduced. With that, WoodStock is now the GGP champion after its victory at the International General Game Playing Competition 2016 (IGGPC 2016).
- Affiliations
Citations
Koriche, F., Lagrue, S., Piette, E., & Tabary, S. (2017). WoodStock : un programme-joueur générique. Revue d’intelligence artificielle, 31(3), 281-310. https://doi.org/10.3166/ria.31.281-310 (Original work published 2017)