Combinatorial Game Theory
who wins, and by how much
Depth

Series — page 5

A field says what an essay is about. A series follows one idea essay by essay — from the question that introduces it to the one that assumes all the others.
Welter positions and what they are worth. Coins on a strip, with the Grundy value the recursion returns and the nim-sum the squares would have if they were independent heaps. The two columns are the essay: they hardly ever agree.

Welter

  1. 1 No two heaps alike
  2. 2 The pairing the formula hides
2 essays · impartial Knowing who wins is not enough. Three pairs of positions, every one of which is in outcome class N on its own. Their sums are not all the same, and not all in the same outcome class — so the outcome of a sum cannot be worked out from the outcomes of its parts, and that is why the theory needs values.

Additivity

  1. 1 Outcomes do not add
1 essay · sums Cram on 4 by 4: the pairing strategy. Cram is Domineering with the orientations shared: either player may place a domino either way up, so both players have exactly the same moves and the game is impartial. Every position therefore has a Grundy value, and this board's was computed by the mex rule over its own placements.

Cram

  1. 1 Cram
1 essay · impartial A hot position, split into its mean and what is left. Each row is a position cooled by exactly its own temperature — the tax at which it stops being worth moving in. The result is the mean value with something small still attached, and the last column is that something, obtained by subtracting the mean from the cooled game rather than by inspection.

Dissociation

  1. 1 A number and a fight
1 essay · temperature Top Entails, one heap at a time. Each heap with the outcome of playing it alone, the Grundy value an ordinary solver would give it, and the moves that win from it. Taking the top coin of a heap forces the opponent to answer in that heap, which is a kind of move no other game on this site has.

Entailing

  1. 1 A move that must be answered
1 essay · limits The context that tells them apart. Two positions put into the same company, one context at a time. Each column is a game X; each cell is the outcome class of that side added to X. Equality means every column agrees, for every X there is — so a single disagreeing column is a disproof, and agreement across a bounded list of contexts is evidence rather than proof. The proof is that the difference is zero.

Equality

  1. 1 Equal in every company
1 essay · sums Options handed to Left in 1 | −1. A position, and one candidate option after another added to it. Where the gift is one the player would never take the value does not move at all; where it is one they would, it does. The last column is the value of the enlarged form, computed by the same recursion as the original.

Gift horse

  1. 1 An option nobody would take
1 essay · values Which of the two operators distributes over a sum. Cooling and heating, each asked whether applying it to a sum is the same as applying it to the parts and adding. The pools are the values born by day two and a set of deliberately hot positions; the counts are of ordered pairs.

Heating

  1. 1 Cooling adds and heating does not
1 essay · temperature The same position, two conventions, two winners. Three-player Nim with the last counter winning. The two columns differ only in what a player does when they cannot win themselves, which is a question the rules do not answer — and the answer decides who wins.

Multiplayer

  1. 1 Three players and no answer
1 essay · limits Four things a position can be. Every position falls into one of four outcome classes, and only three of them correspond to a comparison with zero. The fourth — first player wins — is a position confused with zero, neither greater, smaller nor equal, and it is where the subject departs from arithmetic.

Outcomes

  1. 1 Who moves last
1 essay · values Shove strips, and what each is worth. A shelf of positions with the value the recursion returns beside each. Every one is a number: Shove has no hot positions at all, which is unusual for a partizan game and is the first of the essay's three claims.

Shove

  1. 1 Nothing worth fighting over
1 essay · positions How many different values a Grundy sequence has used. One curve per octal code: the number of distinct Grundy values among the first n heaps. A periodic game runs out of values and its curve levels off. The codes nobody has settled are still climbing at six thousand heaps.

Sparse space

  1. 1 The values that keep arriving
1 essay · impartial

All essays