On the Complexity of the Misère Version of Three Games Played on Graphs

Gabriel Renault, Simon Schmidt

We investigate the complexity of finding a winning strategy for the misère version of three games played on graphs : two variants of the game $\text{NimG}$, introduced by Stockmann…