Reversible option — where it appears
Named by 11 essays across 4 fields — each of them below, with the objects they name alongside it.
Canonical form
Two positions are worth the same when neither player can tell them apart inside any larger game. Deciding that could be an infinite search. Instead there is a normal form — delete what nobody would play, bypass what backfires — and equality becomes a comparison of two small trees.
The move that gives counters back
Poker Nim adds one rule to Nim — a player may put counters back onto a heap from a private reserve. It looks as though a losing player could stall for ever. The winner is decided by exactly the same nim-sum, and the reason is the single most useful idea in the whole reduction apparatus.
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.
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.
Knowing who wins, and knowing what it is worth
Deciding a winner expands positions. Computing a canonical form expands pairs of positions, because a comparison unfolds as a recursion over one subposition of each and the reduction makes many comparisons. Measured on the same nine positions by an evaluator that starts empty every time, the second costs between 1.3 and 279 times the first, and the ratio grows with the tree.
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*.
What is left when the small change is thrown away
Canonical form answers a demanding question: which positions are interchangeable inside every sum whatever. A player with a hot board does not have every sum — an infinitesimal difference cannot decide anything against a genuine fight — so there is a coarser question with an exact answer. The reduced canonical form takes the 1,474 values born by day three to 61, with 292 of them collapsing to zero, and it is a homomorphism on all 8,100 pairs tested only when a second pass is made.
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.
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.
How wide a form can get
Bypassing a reversible option replaces it with a whole option list, so a form grows in the middle of its own reduction. Whether it can come out wider than it went in is the question that leaves standing, and over 64,515 forms built from day-two options the answer is no, not once — the growth is real, it is transient, and the widest canonical form reached is exactly as wide as the widest form that reaches it.
Not a domination, in that order
The rung below asked which pair the second reduction acts on, taking for granted that the operation is a domination. It is not: on none of the 525 deletions is a surviving option greater than or equal to the deleted one. In the order the reduced form actually works in — both stops at least as good — every deletion with a survivor is a domination, the dominator is unique on all but twelve, and it always comes from the other part.
Named alongside it
The objects these essays reach for when they reach for this one.
Canonical formDominated optionComparisonExhaustive searchReductionBorn on dayStar (∗)EqualityNormal playPartial orderUniquenessBirthday