Combinatorial Game Theory
who wins, and by how much
Concept

Residue — where it appears

The remainder a whole number leaves on division by a fixed modulus. Residues mod a power of two are the low binary digits, which is why exclusive-or respects them and why a closed form for a nim-sum is usually a statement about residues mod 4 or 8.

Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.

What is left when the copies pair off. For each position, the difference between n copies and n times the mean, reduced to canonical form. The first two are drawn and the last column says what the sequence does after them: half of these settle into a short cycle and the rest produce a new leftover every time, all of them the same bounded size.

What is left when the copies pair off

A pile of n copies stays within a bounded distance of n times the mean, and the distance never grows. The difference is a game rather than a number, and what it actually is has a much better answer: for a plain switch it alternates between one fight and nothing at all, and for a fight with a follow-up it is different every time — bounded in size and unbounded in complexity.

temperature · Temperature Lasker's Nim in sixteen cells. A four-by-four table. Each row and column is a residue mod 4 of one part of a split heap, with the residue of that part's Grundy value beside it; each cell is the residue mod 4 of the split's value, the nim-sum of the two parts. Every split of every heap to four hundred lands in the cell its residues name.

The proof is sixteen cells

Lasker's Nim has a four-clause formula that was checked on two thousand heaps and never proved. The proof fits in a four-by-four table: the last two bits of a split's value are fixed by the last two bits of its parts, so no split can land in its own heap's class — except at 3 mod 4, where it lands exactly on the one value the takes leave missing and pushes the answer up by one.

impartial · Lasker One split is enough, and some are not. Lasker's Nim beside five versions of it that allow only some splits, over the first twenty-four heaps, with every cell that leaves the formula outlined. Allowing only the split that takes one counter off reproduces the whole sequence; allowing only equal halves turns it back into Nim.

One split is enough

A heap of n in Lasker's Nim offers ⌊n/2⌋ ways to split, and the values use at most one of them. Allow only the split that takes a single counter off and every heap to six hundred keeps its value; of all sixty-three sets of split sizes up to six, a set keeps the formula exactly when it contains 1 or 2. Equal halves alone give back plain Nim, because a split into equal parts is a move to nought.

impartial · Lasker

Named alongside it

The objects these essays reach for when they reach for this one.

Closed formExhaustive searchGrundy valueImpartialMexNim-sumTake-and-breakBinaryCanonical formCounterexampleDisjunctive sumFollow-up

All concepts