Every essay — page 16
Where it stops
Misère play and loopy games: the two places the theory itself gives way — values that stop composing, and a recursion with no bottom.
A coin needs no tie-break
The same recursion has a second derivation: a fair coin decides who moves at each turn, a player whose turn it is with no move has lost, and both play to win. Written from those rules it comes out identical on every position — and it needs no rule for equal bids, because there are no bids. The number is a probability, it belongs to Left rather than Right, and the empty position is the one where the coin decides everything.
Left always wins, and loses more often than not
Alternating play answers with one of four classes and the coin answers with a chance, and the two do not have to agree. Over the twenty-two values born by day two they never disagree and the margin is exactly nothing — the lowest chance on a position Left wins whoever moves is a half. Over the 1,474 born by day three, seven of them sit at seven sixteenths, and seven mirror them on the other side.
Every chance but a certainty
The coin's number lands on a grid of dyadic fractions, and which points of that grid arrive is a count rather than a guess. Over the 1,474 values born by day three it reaches every one of the fifteen interior sixteenths and neither end — no position is ever certain. The groups sharing a chance run 1, 2, 4, 8 on the small pool, which looks like doubling, and 1, 2, 4, 20 on the large one, which is not.
The coldest position has the biggest swing
How much a flip is worth is the gap between the coin's two branches, and it is a rival to the temperature — both answer how much is at stake. They disagree at once: the empty position has the lowest temperature there is and a swing of one, twice the hottest thing born on day two. On the small pool the two quantities look like a perfect three-way correspondence, and 255 of day three's values break it.
The best chance is the wrong move
Maximising a probability and denying an opponent a reply are different objectives, and on 189 of the 904 day-three positions where Left has a choice and a winning move, the option the coin prefers is one that loses the alternating game outright. The smallest case is two options and one line of arithmetic: five eighths beats a half, and a half is the move that wins.
Three heaps and a pass
Nim with a single pass that may not end the game is easy on one heap and on two: a heap swaps each odd size with the even one above it, and two heaps lose exactly at (2k − 1, 2k). On three heaps the losses are known only as a list. Fix the smallest heap and each slice of the list settles into a pattern after an irregular start — period 4, 8, 10, then 160 at a smallest heap of ten, and nothing visible from eleven.
What a component would have to carry
For a held pass to be decided by a summary of each component, the summary must separate every pair of components some company tells apart. The Grundy value does not — Nim 1 and Kayles 8 are equal games that a held pass separates beside a single Nim heap of two. Nor does the Grundy value with the component's own held-pass value: Kayles 3 and Kayles 6 agree on both and are split by a company of two Nim heaps. Over twenty-four components, fifteen classes against fourteen pairs, and the gap widens as the pool grows.
Particular games
Hackenbush, Nim, Domineering, Toads and Frogs — the specific games the general theory was built to explain.
Hackenbush is a numeral
Draw a stalk of coloured edges. Read it as a string, blue for one and red for zero, and the string is the binary expansion of what the position is worth. Not approximately — exactly, and the site computes it both ways and refuses to build if they disagree.
Domineering
One player places dominoes vertically, the other horizontally, on a shared grid. The rules take one line, the values are a mess, and that mess is the point — this is what the theory looks like applied to a game nobody designed for it.
Toads and Frogs
Toads shuffle right, frogs shuffle left, and either may jump over one of the other. A strip six cells long is worth exactly up. Another six-cell strip is worth exactly down. Nobody has a formula for which.
Sprouts, and the game that is not one
Two games played with dots and curves, invented in the same room, all but indistinguishable on paper. One is unsolved past forty spots. The other has no decisions in it at all — the winner is fixed before the first curve is drawn.
One board, two rules
Col forbids painting next to your own colour. Snort forbids painting next to your opponent's. One word differs, the boards are identical, and the values that come out are not the same kind of object.
Cutcake, where every value is a whole number
A partizan game in which no position is ever worth a fraction, a star or a fight. Every value is an integer, the integer is a count of spare moves, and the pattern it follows is decided by binary digits.
Amazons, and when a position becomes a sum
Every technique on this site starts from a position already broken into independent parts. Amazons does not begin that way — the board is one fight until the arrows cut it, and the moment of cutting is something the play produces rather than the analyst assumes.
Squash every loop to a point
Colour every Hackenbush edge green and the game becomes impartial, so the whole picture is worth a single Nim heap. Two principles find which one without playing anything — fuse the cycles, then run one pass up the tree — and a nine-vertex lattice that costs 1,283 positions to solve costs twelve steps to read.
All ladders · Every object named here · The position index · Figures that play back · Search