The Invariance Reduction Process -- a New Tool to Solve Circular Nim and Related Games

TL;DR

The paper introduces the Invariance Reduction Process, a new method for analyzing and solving Nim-related combinatorial games by simplifying position analysis through invariance and reductions.

Contribution

It develops the Invariance Reduction Process and applies it to various Nim variants, providing new insights into their P-positions without complex background.

Findings

Derived structure of P-positions in Set Nim SN(n,A)

Applied the process to Path Nim and Circular Nim games

Showed invariant vectors differ from circuits in describing P-positions

Abstract

We introduce the notion of invariant vectors of a game and develop the Invariance Reduction Process, which first uses reduction of positions via invariance and then zero and merge reductions of games to arrive at smaller, solved sub-games for closed subspaces of the positions. This process makes it much easier to prove that there are moves from N-positions to P-positions, and can also be used in some cases to show that there are no moves between P-positions. This process is suitable for all variations of the game Nim whose rule sets form a simplicial complex. We rephrase Simplicial Nim as Set Nim SN($n,A$) and derive results on the structure of the P-positions in terms of invariant vectors, without needing the background and notation of simplicial complexes. We also show that invariant vectors differ from the circuits used to describe the P-positions in Simplicial Nim and that invariant vectors have wider applicability compared to circuits. We apply the Invariance Reduction Process to derive results on the P-positions of the family of Path Nim games where play is allowed on at least half the stacks, as well as for the Circular Nim games CN($n,k$) with $n=7, k=3$ and $n=8,k=3$.