Complexity, appeal and challenges of combinatorial games
Theoretical Computer Science - Algorithmic combinatorial game theory
Games played by Boole and Galois
Discrete Applied Mathematics
Two variants of Wythoff's game preserving its P-positions
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
We deduce conditions for additive periodicity of the Sprague-Grundy function of Nim-like games, starting with Wythoff's classic game and ending up with a fairly large class of impartial games played on directed graphs.