Year: 2026
Type: preprint
Abstract: We consider a variant of Nim in which, for a fixed set $S$ of nonnegative integers, a move is forbidden if the total number of remaining stones belongs to $S$. This game coincides with normal-play Nim when $S=\emptyset$, and with misère Nim when $S=\{0\}$. In this paper, we focus in particular on the case where $S$ is the set of multiples of $d$, and show that simple criteria for determining the outcome can be obtained for $d=2,3,4$.
Source: arXiv (Cornell University)
Authors: Oginuma, Hiromi, Shinoda, Masato
Institution: Nara Women's University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7202343039
