Concept

Star (∗) — where it appears

The value of a position whoever moves wins, written ∗, which is smaller than no number and larger than none either. It is the smallest thing a comparison cannot rank, and the reason four games rather than nine numbers are needed to separate a day of values.

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

Comparing two positions is playing their difference. To decide whether one position is worth at least another, subtract and see who wins moving second. It is the only definition of comparison the subject has, and it produces a partial order — some pairs come out confused, which no comparison of numbers ever does.

Comparing positions

One position is worth at least another when the second player wins their difference. That is the only definition there is, it is a computation rather than a judgement, and it produces an order in which some pairs are simply not comparable.

sums · Comparison
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.

Outcomes do not add

Knowing who wins each part of a position tells almost nothing about who wins the whole. Counted over every sum of two values born by day two, six of the outcome table's ten entries are settled and four are not — and every settled one is settled by the order rather than by anything about outcomes. Two first-player wins reach all four classes between them.

sums · Additivity
Every row of 8 squares, and the 36 values they hold. A census of Kōnane rows: how many arrangements of a row of squares carry each value, with the shortest row carrying that value printed beside it. Most arrangements are worth nothing at all; the rest spread over numbers, halves and quarters, stars, switches and infinitesimals — the whole vocabulary of the theory, from a game that predates it.

A game older than the theory

Kōnane was played on carved lava boards in Hawai‘i long before anybody wrote a brace notation, and its rule for losing is the normal-play convention arrived at some centuries early. Evaluate a row of it and the answers are halves, quarters, stars and infinitesimals — the theory's whole vocabulary, out of a game that was not built to display any of it.

applied · Kōnane
Smaller than every positive number, and not zero. Values that sit between zero and every positive number, each compared with zero and with 1/1024. Every relation drawn was computed by playing the difference, and one of them is confusion — neither greater, smaller nor equal. None of these is a number, and in a close game they are the entire margin.

Infinitesimals

Some positions are positive — Left wins them whoever moves first — and smaller than every positive number, including a millionth and a millionth of that. They are the values that decide close games, and the smallest of them is a single move's worth of nothing.

values · Infinitesimals
Which part to move in. A sum, and every move one player has in it. Each row is a component, the option taken in it, and what the whole position becomes. The values of the parts say who wins; they do not say where to play, and the winning move here is in the component worth the least.

Which part to move in

The value of a sum is the sum of the values. The move in a sum is not the move in any part, and there is no rule that reads it off the values — in the smallest interesting example, the only winning move is in the component worth nothing.

sums · Disjunctive sum
How many ups, bracketed. Every position here is all-small, so no number says anything about it and the yardstick has to be ↑ instead. Each bar spans the multiples of ↑ the position lies between: the largest it is at least, and the smallest it is at most. Four of the seven are pinned to a single multiple of ↑; the rest keep a band that comparison cannot narrow, the widest being ∗ at four ups of slack.

How many ups

When every component of a position is smaller than every positive number, no number can decide it. What decides it is a count of ups — and comparison can pin that count down exactly, except when a star is present, when it cannot.

sums · Infinitesimals
Col and Snort on a path of four. One graph, two games, and one word of difference between the rules. Col forbids painting next to your own colour, which makes every move a small self-harm and drives the values towards numbers. Snort forbids painting next to your opponent's, which makes every move a land grab and drives them towards fights. Both values are computed from the same recursion.

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.

positions · Colouring
Cutcake: every value an integer. The value of an m by n cake, for every small m and n. Left cuts down, Right cuts across, and neither player ever gains by moving — so nothing is ever at stake, every value is a whole number, and the number says exactly how many spare moves one player has.

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.

positions · Cutcake
Three ways to add the same games. One list of components, added three different ways. Under the disjunctive rule a move is a move in exactly one part; under the conjunctive rule it is a move in every part at once, and play stops as soon as any part runs out; under the selective rule it is a move in any non-empty set of parts. The outcomes are computed by search from each rule's own definition.

Three ways to add the same games

A move in exactly one component is a choice, not a law. Move in every component at once and the game is different; move in any set of them and it is different again. The same two positions, added three ways, give three different answers — and only one of the three has values that add.

sums · Disjunctive sum
The same game, written twice. A position as it arises and the same position reduced. Three of the options are dominated — a sibling is at least as good for the player who owns them — so they can go. The two games are equal — checked, not assumed — and the second is the canonical form.

Two hundred and fifty-six ways to write twenty-two things

Every game whose options come from the four born on day one — there are 256 of them, and between them they carry 22 values. The reduction that collapses one to the other has choices in it at every step, and uniqueness is the claim that none of the choices matters.

values · Canonical form
One position, three ways of writing it, and only one of them adds. The same positions as a sentence about who wins, as a description of the position itself, and in the notation Winning Ways introduced. The first two columns carry identical information and support no operation whatever. The third column can be added — and the sums below it are values that no manipulation of the first two columns could reach, because two of these pairs start from the same two outcomes and finish differently.

The notation was the argument

Up, star and the brace form are not abbreviations for case analyses. They are the claim that these objects add — and the arithmetic they support is arithmetic that no table of outcomes could ever produce, because two positions with identical outcomes can have different sums.

history · Notation
A blocked file, and the tempo it holds. Files of a blocked pawn ending: a White pawn below, a Black pawn above, and a gap between them that either side may close one square at a time. Each file carries the value the game recursion gives it. With only single steps available a file is worth a star or nothing, by the parity of the gap, so the whole position is tempo and no material at all — which is what a chess player means by mutual zugzwang.

A pawn ending is a sum

In a blocked pawn ending the material is level, the files never speak to each other, and whoever has to move is the one in trouble. Chess calls that mutual zugzwang; this site calls it a P-position; and the two vocabularies were built four decades and one subject apart to say the same thing.

applied · Chess
Clobber: every value smaller than every number. Blue and red stones on a small board. A move takes one of your own stones onto an orthogonally adjacent enemy stone, which is removed. Because adjacency is symmetric, a player has a move exactly when the opponent does — so no position can ever be worth a whole move to anybody, and every value that comes out is an infinitesimal.

A game where nobody can be ahead in moves

A blue stone beside a red one is a move for both players at once. So neither player can run out while the other still has something to do — and every value the game produces is smaller than every positive number, by the shape of the rule rather than by inspection.

positions · Clobber
Tiny and miny: infinitesimals with a scale. Positions that are greater than zero and smaller than every positive number, and which are nevertheless strictly ordered among themselves — the larger the subscript, the smaller the value. Being smaller than everything positive is not one size of thing; it is a whole scale, and up sits above all of it.

Tiny, miny, and the sizes below every size

An empty two-by-four Domineering board is worth less than nothing and more than every negative number. It is not up, not down and not a fraction — it is a miny, and the minies come in sizes, strictly ordered among themselves below a floor no number reaches.

values · Infinitesimals
A green edge is not a number. Green edges may be cut by either player, which makes the position impartial in that part. A single green edge is worth ∗ — a value that is neither positive, negative nor zero, and which no number can equal.

A green edge on a blue one

Blue over green and green over blue are the same two edges in the other order. One is worth 1∗ and the other ↑∗ — a number with a star on it against something smaller than every positive number — so a stalk with all three colours in it stops being a numeral and starts being a position whose value depends on what is underneath.

positions · Hackenbush
Clobber: every value smaller than every number. Blue and red stones on a small board. A move takes one of your own stones onto an orthogonally adjacent enemy stone, which is removed. Because adjacency is symmetric, a player has a move exactly when the opponent does — so no position can ever be worth a whole move to anybody, and every value that comes out is an infinitesimal.

The class where nobody runs out first

Three stones in a row — blue, blue, red — and the position is worth exactly up. Clobber cannot produce anything else, because adjacency is symmetric — a player has a move precisely when the opponent does, and a game with that shape can never be worth a whole move to anybody.

values · Infinitesimals
What the two outcome classes of the parts settle. For each pair of outcome classes, the set of outcomes the sums actually took. A cell with one letter is a pair of classes that decided the answer; a shaded cell with several is a pair that did not. Both conventions have ambiguous cells — the difference is that normal play repairs them with values and misère play has nothing to repair them with.

Two misère outcomes are not enough

Knowing who wins each part does not say who wins the sum. Over 676 sums built from a pool of twenty-six positions, nine of the sixteen pairs of outcome classes settle the answer under normal play and not one of the sixteen settles it under misère — and the nine that work are theorems about a value being zero, which is exactly the thing misère play does not have.

limits · Misère play
Comparing two positions is playing their difference. To decide whether one position is worth at least another, subtract and see who wins moving second. It is the only definition of comparison the subject has, and it produces a partial order — some pairs come out confused, which no comparison of numbers ever does.

Confused is not the same as unknown

Two positions can be neither greater, nor smaller, nor equal. That is a fourth relation with its own symbol, it is a fact about the pair rather than a limit of the method, and it is what makes a game worth playing — a position is a first-player win exactly when it is confused with zero.

sums · Comparison
Every position of both games, and where the fights are. Every colouring of every graph in the library, under both rules, with the temperature of each computed. A position with a positive temperature is one both players want to move in. Col has none anywhere; Snort has them on every graph, and the hottest grows with the graph.

One rule makes it cold, the other hot

Col forbids painting next to your own colour and Snort forbids painting next to your opponent's. Over all 540 colourings of six graphs, not one Col position has anything at stake and 61 Snort positions do — the difference between a game that is a count and a game that is a series of fights, produced by one word.

positions · Colouring
The picture is the numeral. Blue-red Hackenbush strings and their values. Left may cut a blue edge, Right a red one, and everything above the cut falls. The value of each string is a number, and reading the string from the ground upward gives the binary expansion of exactly that number.

The other sum, the one that nests

A move in one part wipes the other out entirely. That is the ordinal sum, it is what a Hackenbush stalk actually is — 1 : (−1) is a half, and 1 : (−1) : 1 is three quarters — and it is not an operation on values at all: three positions all worth zero give three different answers under it.

sums · Ordinal sum
Cooling by 1, and heating back. Each row is a position, its temperature, what it becomes when every move is taxed, and what comes back when the tax is refunded. The refund is not an inverse: a position whose temperature was below the tax has already frozen into a number, and heating a number does nothing at all.

Cooling by exactly one

Cooling is usually met as a way of reading a thermograph: a tax, and two numbers at the height of the tax. Applied as an operator it returns a position instead — and then the obvious question is whether heating gives the position back. Over the 1,474 values born by day three, 27 survive the round trip and 15 of those are numbers that never moved. Cooling throws away almost everything it touches.

temperature · Chilling
The bracket of a sum, against the sum of the brackets. Two all-small positions, the interval of multiples of ↑ each lies between, those two intervals added coordinatewise, and the interval the sum actually lies between. The added one always contains the computed one — greater-than survives addition — so the bracket never widens under a sum. Where it narrows, the parts were each too vague to pin down and the sum is not.

When the ups add

Atomic weight brackets do not add over a sum — they bound it. Over all 120 pairs from a fifteen-game family the sum's bracket came out exactly the sum of the parts' brackets 56 times, strictly narrower 64 times, and wider never; and the rule separating the two is one line long, because every one of the 54 pairs with a pinned part is exact and only 2 of the other 66 are.

sums · Infinitesimals
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.

A number and a fight

Charge a position exactly what it is worth fighting over and the fight disappears, leaving the mean value — with something still attached to it. Over all 1,122 hot values born by day three the residue is smaller than every positive number, it is a star in 942 of them, and it is never nothing. So a hot game is its mean plus a fight plus a remainder that no number reports, and the remainder is what decides close games.

temperature · Dissociation
Amazons on one line. A one-dimensional Amazons board: an amazon slides along the row and shoots along the row, and the square the arrow lands on is burnt for the rest of the game. The whole board fits in a sentence, and the values it produces are already of several different kinds.

Amazons on one line

A board one square high is small enough to evaluate completely: every strip from two to ten squares with one amazon a side is 37,886 positions taking 81 distinct values, and every one of them is an integer, a switch, a number plus a star, or a bare star. Not one is a fraction — and forcing the arrow onto the square just vacated, which takes a freedom away rather than adding one, produces 1,196 that are.

positions · Amazons

The values that are their own negatives

Every game satisfies G + (−G) = 0, so a game equal to its own negative satisfies G + G = 0 — it has order two in a group whose elements otherwise have infinite order. The nimbers do. So does ±1, on sight. Over the 1,474 values born by day three there are 30 of them and only four are nimbers, every one of the 900 sums of two is another, and the equality test and a symmetry of the written form agree 1,474 times out of 1,474.

sums · Negation

How old a value is

A form's depth bounds the birthday of the value inside it, and reducing to canonical form attains the bound — for all 22 values born by day two, with no exception. Twenty-four of the 256 forms are older than what they are worth. The same reduction that makes the bound tight is what puts day three within reach: 98 option sets a side instead of four million, 9,604 forms, 1,474 values, a quarter of a second.

values · Numbers

The same strip without the jump

Delete one clause from Toads and Frogs — the hop over an opponent — and the game is Elephants and Rhinos. Over the same 3,279 strips the values do not become simpler in the way a reader would guess: every value that is a number becomes an integer, against 172 fractions with the jump in, and the count of positions worth fighting over nearly doubles. Removing a move made the game hotter.

positions · Toads and Frogs

Taking from the ends

End-Nim is Nim's board with a player at each end, and it takes one sentence to state. Not one of its 5,460 small positions is worth a non-zero number — the game is all-small, so zero is the only number any of them can reach — and there are 2,693 distinct values between them. The outcome says a great deal more: 4,738 of those positions are won by the same player whoever moves, and on two heaps the rule is that the larger end wins.

positions · End-Nim

Nobody has to move

Every convention here rests on one sentence nobody examines — the players move alternately. Replace it with an auction and a position stops having an outcome class and starts having a number: the share of the money the second player needs. The 22 values born by day two collapse to seven of those numbers, eight of them landing on exactly a half; the new number respects the game order on all 179 comparable pairs, and is not determined by the parts under addition on 14 of 49.

limits · Bidding

What a number does to a fight

Adding a number to a position moves everything and changes nothing: over three thousand translations the temperature never once shifted and both stops moved by exactly the number added, every time. What the number decides is whether the fight is worth having — and the interval where the two players are confused is exactly the open interval between the negated stops, right in all 2,890 cases away from its endpoints and wrong in 110 that are all on them.

sums · Translation

When a switch is not a switch

A position {a | b} with numbers on both sides is a fight only while a is above b. Sweeping the boundary with a fixed at 2 and b climbing from −2 to 3 turns up three regimes rather than the two the definition suggests: eight fights whose temperature is exactly half the gap, one position at a = b that is 2∗ and is not a number, and beyond that numbers chosen by the simplicity rule — which on 8 of 12 sampled cases is not the midpoint.

values · Switches

Cooling adds and heating does not

The two operators are presented as a pair, and they are not one. Cooling a sum is the same as cooling the parts and adding, on every one of the 1,768 pairs tried, at two taxes and on two pools. Heating fails on 263 — and not for the obvious reason: in every failure neither part and not the sum is a number, so the clause exempting numbers never fires at the top. It fires two levels down, where an option of a sum is one part's option plus the whole of the other.

temperature · Heating

How rare it is to be bigger

Values are partially ordered, and 'partially' does most of the work. On day two, 179 of 231 pairs can be compared and 13 of the 22 values can be compared with zero. One day later the shares are 60% and 29%, and the largest set of mutually incomparable values found rises from four to at least twenty-three. Comparison is the exception; confusion is what values normally do to one another.

sums · Comparison

One row of Clobber

Every string of blue, red and empty squares up to eight long — 9,840 rows — carries one of only 111 values, and every one of them is infinitesimal. A third of the rows are worth exactly zero. Six alternating stones are worth zero and eight are worth a form that takes four lines to print, so the values do not simplify as the row grows: they explode, while the row stays trivial to describe.

positions · Clobber

An option nobody would take

Every reduction of a form deletes. The gift horse principle adds: a move may be handed to a player for nothing, provided it is one they would never choose. Over all 484 additions to the values born by day two, 283 leave the value exactly where it was and the 201 that move it are precisely the ones the condition forbids — with the boundary at *not better*, which is a weaker demand than *worse*.

values · Gift horse

Equal in this company

Equality quantifies over every game there is, and the quantifier can be made smaller. Restricted to a company of nine numbers, the twenty-two values born by day two collapse to seventeen; restricted to four games — nought, one, minus one and star — they stay twenty-two, and no three of the four will do. The company that decides equality is tiny, and it has to contain a star.

limits · Universes

The operator chosen for one game

Chilling is cooling by exactly one, and the one is not derived from anything. It is chosen because Domineering mostly runs at that temperature — and measured against this site's whole Domineering catalogue it turns thirteen of fifteen boards into numbers or numbers plus a star, and warms thirteen of the fifteen back exactly. They are not the same thirteen: eleven boards do both, two freeze too far to be recovered, and two stay hot and come back on the nose.

temperature · Chilling

Below zero

Temperature is described as urgency and urgency has no obvious bottom, but the scale stops at −1 and only the numbers are on it. The rung above is exactly zero, and the 337 values born by day three that sit there are the ones a number cannot be told from — flat thermograph, nothing at stake, and an infinitesimal that no number can see. Two independent computations agree on the classification for all 1,474.

temperature · Cold

The simplest game above both

Values sit in a partial order, and a partial order is entitled to be ragged: two things with no least thing above them. The 22 values born by day two are not ragged at all. Every one of their 253 pairs has a least upper bound and a greatest lower bound among the same 22, and the order is distributive on all 10,648 triples — so it is a lattice, and the join of zero and star is one half.

values · Lattice

Two players, two lists

Give each player their own list of how many counters they may take and the impartial theory stops applying. What survives is the outcome: it settles into a repeat, for every pair of lists, and that is a theorem. What does not survive is the value — on four of six pairs swept it has no repeat inside sixty heaps, and the birthdays are still climbing at the edge of the window.

positions · Partizan subtraction

Nobody wants to move here

A position is a number exactly when every move loses ground for the player making it. The test never mentions numbers, it disagrees with the ordinary one on none of the 1,474 values born by day three — and the reason a position fails it is not that somebody wants to move. It is that somebody cannot afford to wait.

values · Incentives

Topple it from either end

A row of blue and red is the picture this site opens with, and under Hackenbush's rules it is always a number. Knock the pieces over instead of cutting them — everything on the chosen side falls — and 480 of the 510 rows up to eight pieces stop being numbers. The two games agree on sixteen rows, every one of a single colour, and the temperature of the hottest row climbs by exactly a half for each domino added.

positions · Toppling dominoes

The operator that puts the star back

Chilling is not invertible: it freezes, and 400 values born by day three collapse onto 29. Both heating and Norton's warming operator are exact right inverses of it — each lands back where it started, on all 400 — and they pick different preimages, differing on 396 of them and differing by exactly a star on 335. The clause that separates them is one line long and it is about the integers.

temperature · Chilling

The reduction that puts options back

Canonical form is presented as simplification, and half of it is. Deleting a dominated option takes one away. Bypassing a reversible one substitutes the answer's whole option list, so it can leave the form wider than it started — and 60 of 32,428 forms end up with a canonical form wider than they are.

values · Reversibility

What an infinitesimal does to a fight

Adding a number moves both stops by exactly itself. Adding something smaller than every number moves neither — across 10,318 additions to a whole day of values, not once — and the outcome class changes anyway, 2,622 times. It changes at exactly one kind of position: the ones with a stop sitting on zero, which is where the numbers have run out of things to say.

sums · Translation

The reduction that always shrinks

Canonical form is two reductions and they are not the same kind of operation. Deleting a dominated option removes one option and can do nothing else; bypassing a reversible one substitutes a whole option list. Over the 256 forms born by day two, deleting alone finishes 225 of them and accounts for 480 of the 520 options that come off — and the 31 it cannot finish are almost all the ones with a star in them.

values · Dominance

Every group must keep breathing

NoGo is Go with no captures at all: a stone may be placed only if, afterwards, every group on the board still has a liberty. That makes a move's legality a fact about the whole board rather than about the squares it occupies — and a board therefore almost never breaks into independent parts. Of 117 boards here whose empty points fall into two regions, 24 are the sum of their regions and 93 are not.

positions · Nogo

The values nobody's game produces

The construction hands down 1,474 values by day three. Seventeen rulesets on this site, swept to eleven thousand positions, produce 1,193 — and only 116 of those are on the construction's list. Two of the twenty-two values born by day two are produced by no position of any game here, and 1,077 of the values that are produced are born later than day three. A value's birthday and a value's reachability have almost nothing to do with each other.

values · Realisability

The numbers it is confused with

A position is confused with a number when neither is at least as good as the other, and the set of such numbers is an interval. It is exactly the open interval between the two stops: over 36,850 comparisons the rule is wrong nowhere it speaks, and the 2,596 comparisons it declines are precisely the ones at an endpoint, where the position and the number differ by an infinitesimal.

values · Stops

The strip where every number is a whole one

Delete the hop from Toads and Frogs and the halves, quarters and ups vanish completely: over 9,801 strips, every value that is a number is an integer, without a single exception. The guess that the hopless game therefore has a formula reading the gaps is half right and exactly wrong — 1,460 strips of eight squares are switches, and three strips with the same counts of toads, frogs and empty squares are worth 1, {2 | 1} and 2.

positions · Toads and Frogs

When the bracket decides

A Clobber row's value is an all-small game nobody can hold in their head, so the practical answer is the up-bracket: a pair of integers between which its atomic weight must lie. As an approximation it is worth exactly what it settles — 1,585 of 7,875 pairs of rows are ordered by it, every one of those orders is right, and of the 6,290 it declines, 4,222 have no answer either.

positions · Clobber

Which end of the interval is open

The confusion interval is open at both ends, and the two ends are not the same kind of open. At its own left stop a position can be below the number, confused with it or equal to it, and — over 2,948 comparisons — above it exactly thirty-three times, every one of them a value whose two stops are the same number and whose left end is therefore also its right one.

values · Stops

The birthday of a sum

Two values born by days m and n have a sum born by day m + n at the latest, which is the bound that stops a board made of many small parts from being unboundedly complicated. Over 231 pairs of day-two values the bound holds every time and is exact 163 times — and every pair it misses by three days or more has a sum that is a number or a nimber, so the slack is not noise but a measure of how much cancelled.

values · Numbers

How hot a day gets

A day of construction buys exactly one degree of temperature — nought, then one, then two — and the value attaining the maximum is unique on every day: ∗, then {1 | −1}, then {2 | −2}. The distribution underneath is not tidy at all: it peaks at a half, leans to the right of the peak, and has a hole in it at one and three quarters where nothing is born.

temperature · Cold

How long a row a value needs

Add a third colour that either player may topple and a row of seven dominoes reaches 1,047 distinct values where two colours reach 149. That makes the length of the shortest row worth a value into a measure of the value's complexity — one a reader can hold in their hand — and it is not the birthday: 1↑ is born on day three and needs seven dominoes.

positions · Toppling dominoes

A sequence with a rule and no period

The values of the subtraction game where Left takes one or two and Right takes one or three never repeat — thirty-one heaps, thirty-one different values. They are nonetheless completely described: three seeds and the rule v(k + 3) = {0 | v(k)} generate every one of them, which is what a pattern without a period looks like.

positions · Partizan subtraction

Where the order and the sum disagree

Day two is a lattice, and day two is a group, and it is not a lattice-ordered group. The one identity that would join the two structures — the join plus the meet equals the pair — holds on exactly the 201 pairs where it cannot fail and on none of the other 52, and the errors split thirteen high, thirteen low and twenty-six confused.

values · Lattice

The same position, written once

Writing out the canonical forms of day three takes 24,940 nodes. Naming each distinct subposition once inside each form takes 10,102, and naming each distinct subposition once across the whole day takes exactly 1,474 — one per value, because nothing appears inside a canonical form that is not itself a value of the day.

values · Reversibility

A fight with no midpoint

The mean of {a | b} is the midpoint and the temperature is half the gap — on the twenty-one values of day three where a and b are numbers. One hundred and forty-six others have the same shape and not the hypothesis, and the repair that suggests itself, reading the two stops instead of the two options, holds on about three quarters of them and no more.

values · Switches

Where the nimbers run out

A single End-Nim heap is a Nim heap and every palindromic row is worth a nimber, so the impartial theory looks as though it might get a long way into a partizan game. It gets one row in thirteen. Five nimbers occur in five and a half thousand rows, the palindromes account for two fifths of them, and the rows worth something else run to 2,693 distinct values.

positions · End-Nim

The thirty that cancel themselves

Thirty values born by day three are equal to their own negatives, and every one of them has a mean of exactly nought and two stops that are exact opposites. Neither property comes close to picking them out — 496 values of the day have a mean of nought — and half of the thirty are hot, one of them the hottest value the day produces.

sums · Negation

Fifty-two errors and seven sizes

Day two is a lattice and a group and not a lattice-ordered group, and the fifty-two incomparable pairs it fails on leave fifty-two different error terms. Measured rather than listed, the fifty-two collapse: seven pairs of stops, three means, three temperatures, and a rule that predicts the temperature from the pair on forty-four of them.

values · Lattice

The rows that are their own mirror

Four hundred and ten End-Nim rows are worth nimbers and 168 of them are palindromes, so a condition covering the other 242 was outstanding. It is that the row is equal to its own negative — and on this game that condition is not merely sufficient but exact, which is more than the group law promises and is a fact about End-Nim rather than about games.

positions · End-Nim

The company that is closed

Restricted equality licenses substitution only inside a company closed under addition, and none of the five companies this site computes in is closed — day two keeps a quarter of its own sums. Searching for companies that are closed finds seven, at one, two, four and eight members, and every member of every one of them is its own negative.

limits · Universes

What the colon respects

The ordinal sum reads the form of its base rather than its value, which is why the colon principle is stated for positions and not for values. Built over 9,604 forms it turns out to read the value on 636 of the 640 values that have more than one form, and the four it can tell apart are zero, one, minus one and star — the values born by day one, and no others.

sums · Ordinal sum

Seventy-two of them were not silence

The rung below said its 181 unanswered decisions were all the rules falling silent and asked whether the position's value picks the placement once the geometry cannot. Seventy-two of the 181 are the rules speaking and being wrong, which is a different failure. On the 109 that really are silence, a rule chosen per value answers more than half — and the star class the rung below singled out is settled outright by leaving the younger position.

values · Tempo

A mex with no impartial game in it

The rung below described the zero fibre of the mirror map and left star's fourteen undescribed. Star's fibre is 'some element is at least nought, and none is at least star' — and the two rules are one rule: the mirror value is the least nimber no element of the set reaches. That is a mex, in a construction built entirely from partizan values.

sums · Negation

The case that was supposed to be hard

The mex rule for the mirror construction was to be proved by induction, and the step flagged as needing care was the one where an option is incomparable with the nimber. There is no induction: the argument is four lines, and incomparability is what makes two thirds of the cases go through — because a fuzzy sum is a first-player win and the first player is the opponent.

sums · Negation

Where the braces stop

The brace notation names every game exactly — 1,474 games born by day three, 1,474 different expressions, no two alike. It also gets long: the middle one is twenty-two characters and the abbreviations everybody actually writes cover one game in twenty-three. And it has two hard edges. A game with a cycle in it has no finite expression at all, and the equation the minus sign encodes — that a game and its negative cancel — is false under misère play on every one of those 1,474.

history · Notation

Two names that add to nothing nameable

The special symbols reach one game in twenty-three at day three. Coverage is the wrong measurement. The notation exists so that positions can be added, and a sixth of the sums of two named values at day three cannot be written without opening a brace — starting with a sum of two of the six symbols anybody learns first.

history · Notation

A board is written as a sum

Every measurement of the brace notation so far has been of a single position, and nobody writes a single position. A board is several parts, and it can be written as the parts joined by plus signs or as the one value they add up to. Over every sum of up to four games born by day two, the one value is usually the shorter — and the share of boards that need a brace climbs with every part added, until the longest value is four times its sum.

history · Notation

Named alongside it

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

Exhaustive searchInfinitesimalCanonical formUp (↑)ComparisonTemperatureDisjunctive sumOutcome classSwitchPartizanAll-smallNimber

All concepts