Skip to Main content Skip to Navigation
Theses

Programme modulaire pour la résolution des jeux combinatoires : application au Sprouts et au Cram

Simon Viennot 1, 2 
2 SMAC - Systèmes Multi-Agents et Comportements
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : The goal of this thesis is to compute the winning strategies of combinatorial games. We show how to accelerate the computation of impartial games when some positions can be splitted into sums of independent components. We detail in particular the concept of reduced canonical tree in misere computations. We have applied these algorithms successfully to the game of Sprouts, where two players draw lines between spots, and the game of Cram, where the players fill a grid with dominoes. Then, we present an innovative method for monitoring the computation and allowing the human operator to interact in real-time. We also describe the architecture of the modular program that allowed us to compute a lot of different results in a single framework.
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00839388
Contributor : Bruno Beaufils Connect in order to contact the contributor
Submitted on : Monday, July 1, 2013 - 1:40:49 AM
Last modification on : Wednesday, September 7, 2022 - 8:14:05 AM
Long-term archiving on: : Wednesday, October 2, 2013 - 4:10:38 AM

Identifiers

  • HAL Id : tel-00839388, version 1

Citation

Simon Viennot. Programme modulaire pour la résolution des jeux combinatoires : application au Sprouts et au Cram. Intelligence artificielle [cs.AI]. Université des Sciences et Technologie de Lille - Lille I, 2011. Français. ⟨tel-00839388⟩

Share

Metrics

Record views

274

Files downloads

181