Purely Periodic Three-move Subtraction Games
Hikaru Manabe
math.CO
Sep 4, 2026 · v2
TL;DR
Results on purely periodic three-move subtraction games are accompanied by a Lean 4 formalization provided as ancillary files, with coverage documented there.
Abstract
We determine the full Sprague-Grundy sequence and its least period for a class of three-move subtraction games whose sequences are periodic from the start. Write the move set as $S=\{a,b,c\}$, with $0<a<b<c$ and $\gcd(a,b,c)=1$. The case $a=1$ is known and is summarized separately. For $a\ge2$ and $c\ne a+b$, we give three explicit sufficient tests for pure periodicity, associated with the candidate periods $a+b$, $c+a$, and $c+b$. For fixed $a,b$, the tests depend only on $c\bmod(a+b)$ and are computed from the losing positions of the two-move game $\{a,b\}$. Whenever a test succeeds, we give the losing positions in closed form, reconstruct the remaining values, and prove that the least period is the smallest candidate whose test succeeds. The construction shows how the added move $c$ modifies the two-move pattern to form a repeating block. We also give a uniform formulation of the known additive case $c=a+b$. For $a\ge2$, we conjecture that the tests cover every purely periodic non-additive game. In this range, when $c\ge2(a+b)$, we prove necessity for purely periodic games with least period at most $a+b$.
Problem
The work asks which three-move subtraction games S={a,b,c} have Sprague-Grundy sequences that are periodic from the start, and what their full nim-sequence and least period are, for a≥2 and gcd(a,b,c)=1.
Approach
The losing positions of the two-move game {a,b} repeat with period a+b. The added move c is described by its angle ρ=c mod (a+b) on the circle Z/(a+b)Z. Three arc-avoidance tests are given for the candidate periods a+b, c+a and c+b. P-positions are given in closed form, Ferguson's pairing and an L-function parity rule recover nim-values 1, 2 and 3, and the additive case c=a+b receives a uniform treatment. A Lean 4 formalization and verification scripts are supplied as ancillary files.
Results
Whenever a test succeeds, the game is purely periodic and its least period is the smallest candidate whose test succeeds. The converse is conjectured and proved for c≥2(a+b) when the least period is at most a+b. A finite check of all primitive non-additive triples with a≤8, b≤40, c≤100 found 7,557 admissible cases, all purely periodic, and 7,828 non-admissible cases, none purely periodic.