From heaps of matches to the limits of computability

Urban Larsson, Johan Wästlund

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifyin…