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

Research paper by Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Eric Sopena

Indexed on: 17 Dec '16Published on: 17 Dec '16Published in: arXiv - Mathematics - Combinatorics


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.