Octal Games on Graphs: The game 0.33 on subdivided stars and bistars

Abstract : Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters from a heap, sometimes being allowed to split a heap into two nonempty heaps, until no counter can be removed anymore. We extend the definition of octal games to play them on graphs: heaps are replaced by connected components and counters by vertices. Thus, an octal game on a path P_n is equivalent to playing the same octal game on a heap of n counters. We study one of the simplest octal games, called 0.33, in which the players can remove one vertex or two adjacent vertices without disconnecting the graph. We study this game on trees and give a complete resolution of this game on subdivided stars and bistars.
Type de document :
Pré-publication, Document de travail
IF_PREPUB. Rapport LAAS n° 16495. 2018
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

Contributeur : Antoine Dailly <>
Soumis le : mercredi 4 avril 2018 - 10:39:08
Dernière modification le : mercredi 31 octobre 2018 - 12:24:25


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01418153, version 2
  • ARXIV : 1612.05772


Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, et al.. Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. IF_PREPUB. Rapport LAAS n° 16495. 2018. 〈hal-01418153v2〉



Consultations de la notice


Téléchargements de fichiers