Combinatorial Game Theory
who wins, and by how much
Generator

{2 | 0}, added to itself

{2 | 0}, added to itself
{2 | 0}, added to itself. The value of n copies of one position, for each n, beside n times its mean and the smallest distance between the two. The mean value theorem says that distance stays bounded however many copies are piled up — and the bound is the position's temperature, which is what makes the temperature a second genuine measurement rather than a diagram-reading convenience.

The value of n copies of one position, for each n, beside n times its mean and the smallest distance between the two. The mean value theorem says that distance stays bounded however many copies are piled up — and the bound is the position's temperature, which is what makes the temperature a second genuine measurement rather than a diagram-reading convenience.

5 essays call many-copies. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.

Where it is called

Changing this generator changes every one of these figures.

{2 | 0}, added to itself. The value of n copies of one position, for each n, beside n times its mean and the smallest distance between the two. The mean value theorem says that distance stays bounded however many copies are piled up — and the bound is the position's temperature, which is what makes the temperature a second genuine measurement rather than a diagram-reading convenience. Temperature

The same fight, eight times over

The mean is not roughly what a position is worth. It is the number that eight copies of the position stay close to — and the theorem is that the closeness does not decay as the copies pile up. The gap stops at the temperature, and stays there for ever.

 The thermograph of {5 | 1}. Temperature runs up the page and value across it. Each wall is where a player is willing to move once a tax of that much is charged per move; above the temperature at which they meet, neither wants to move and the position is worth its mean value. The height of the meeting point is what is at stake. The two marks on the base line are the stops — what each player gets by moving first and playing the fight out with no tax charged at all. Values

Where the fight stops

Keep taking the biggest thing on offer until somebody is left facing a number, and the number reached is a stop. Every position has two of them, one for each player moving first, and between them they say how a fight ends — except for the part of it no number can reach.

 What a deeper position does to the shape. Thermographs side by side, two of them, with temperature running up each panel and value across it: {{6 | 2} | {1 | −3}}, with a bend where an option's own fight cools out; {4 | −1}, straight-walled. A wall that runs straight has nothing changing hands below the meeting point; a bend is an option's own fight cooling out at a lower temperature than this position's, and it is where a decision passes from one player to the other. The two marks on each base line are the stops — what each player gets by moving first with no tax charged. Values

The switch a player is imagining

Every account of a hot position ends up as "worth about m, and worth t to move in", which is the switch {m+t | m−t}. For a plain fight that summary is the position exactly. For a fight with anything behind it the leftover is not a rounding error — on one position here it is a whole second fight of temperature two.

 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. Temperature

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.

 {2 | {1 | 0}}, added to itself. The value of n copies of one position, for each n, beside n times its mean and the smallest distance between the two. The mean value theorem says that distance stays bounded however many copies are piled up — and the bound is the position's temperature, which is what makes the temperature a second genuine measurement rather than a diagram-reading convenience. Temperature

The residues as a sequence

Four of the eight residue sequences never repeat, and a recurrence is not a description. There is a closed form and it is not for the game: the stops and the temperature of the n-th residue are periodic with period one, two or four on every sequence in the pool, while three of them produce a different game at every n.

The whole library · The position index · The figures that play back