Dicots, and a taxonomic ranking for misère games - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Theory, Series A Année : 2015

Dicots, and a taxonomic ranking for misère games

Paul Dorbec
A. N. Siegel
  • Fonction : Auteur

Résumé

We study combinatorial games in misere version. In a general context, little can be said about misere games. For this reason, several universes were earlier considered for their study, which can be ranked according to their inclusion ordering. We study in particular a special universe of games called dicots, which turns out to be the known universe of lowest rank modulo which equivalence in misere version implies equivalence in normal version. We also prove that modulo the dicot universe, we can define a canonical form as the reduced form of a game that can be obtained by getting rid of dominated options and most reversible options. We finally count the number of dicot equivalence classes of dicot games born by day 3.

Dates et versions

hal-02264656 , version 1 (07-08-2019)

Identifiants

Citer

Paul Dorbec, Gabriel Renault, A. N. Siegel, Eric Sopena. Dicots, and a taxonomic ranking for misère games. Journal of Combinatorial Theory, Series A, 2015, 130, pp.42-63. ⟨10.1016/j.jcta.2014.10.006⟩. ⟨hal-02264656⟩

Collections

CNRS TDS-MACS
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More