Generator

256 ways of writing a position, 22 values between them

256 ways of writing a position, 22 values between them
256 ways of writing a position, 22 values between them. Every game whose options come from the four born on day one — 256 of them, counting each choice of Left and Right option sets separately. Reduced to canonical form they carry 22 distinct values, and the classes are nothing like equal in size: the largest holds a quarter of all the forms and the smallest holds four.

Every game whose options come from the four born on day one — 256 of them, counting each choice of Left and Right option sets separately. Reduced to canonical form they carry 22 distinct values, and the classes are nothing like equal in size: the largest holds a quarter of all the forms and the smallest holds four.

11 essays call form-census. 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.

The positions it draws

22 distinct positions, harvested by running this generator again at the options each essay passed it.

PositionWorth OutcomeDrawn in
{∗ | −1} {∗ | −1} R The fight never runs backwards
{0, ∗ | −1} {0, ∗ | −1} N The fight never runs backwards
{1 | ∗} {1 | ∗} L Cooling adds and heating does not · The birthday of a sum · The fight never runs backwards
{1 | 0, ∗} {1 | 0, ∗} N The fight never runs backwards
L A number and a fight · The class where nobody runs out first · Below zero · Cooling adds and heating does not · Cooling by exactly one · Equal in every company · Turn the board through a right angle · Infinitesimals · Misère play has no negatives · Nobody has to move · Nobody wants to move here · One part that never ends · Three ways to add the same games · Outcomes do not add · The birthday of a sum · The company that is closed · The fight never runs backwards · The simplest game above both · The sum is the object · Toads and Frogs · What a number does to a fight · What a wider pool rescues · What an infinitesimal does to a fight · What can be struck out · What is left when the small change is thrown away · When the ups add · Which part to move in · Who moves last
↑∗ ↑∗ N Infinitesimals · Nobody has to move · Nobody wants to move here · Outcomes do not add · The fight never runs backwards · Toads and Frogs · Two misère outcomes are not enough · What a number does to a fight · What an infinitesimal does to a fight · When the ups add
R Cooling adds and heating does not · Infinitesimals · Nobody has to move · Nobody wants to move here · Outcomes do not add · The fight never runs backwards · Toads and Frogs · What an infinitesimal does to a fight · Who moves last
↓∗ ↓∗ N The fight never runs backwards
−1 −1 R A rule with no promise at all · The fight never runs backwards · The other way to move a row
−1/2 −1/2 R The fight never runs backwards
−1∗ −1∗ R The fight never runs backwards
−2 −2 R The fight never runs backwards
N A move that must be answered · A number and a fight · A rule with no promise at all · A self-negative value costs a day · At least five hundred and seventy-one · Below zero · Cooling adds and heating does not · Cooling by exactly one · Equal in every company · Equal in this company · Turn the board through a right angle · Fifty-two errors and seven sizes · How hot a day gets · How rare it is to be bigger · Infinitesimals · Misère play has no negatives · Nobody has to move · Nobody wants to move here · Nothing worth fighting over · Numbers avoid numbers · One part that never ends · Three ways to add the same games · Outcomes do not add · The birthday of a sum · The company that is closed · The fight never runs backwards · The first theorem, and the winner it declines to name · The other way to move a row · The simplest game above both · The thirty that cancel themselves · The values that are their own negatives · Three players and no answer · Toads and Frogs · What a number does to a fight · What a wider pool rescues · What an infinitesimal does to a fight · What can be struck out · What is left when the small change is thrown away · When the ups add · Where the impartial theory stops · Where the order and the sum disagree · Which part to move in · Who moves last · Start at the end and work backwards
∗2 ∗2 N A move that must be answered · At least five hundred and seventy-one · Equal in every company · Equal in this company · Turn the board through a right angle · Misère play has no negatives · The fight never runs backwards · The simplest game above both · The sum is the object · The thirty that cancel themselves · The values that are their own negatives · Two misère outcomes are not enough · When the ups add · Where the impartial theory stops · Which part to move in
0 0 P A rule with no promise at all · A self-negative value costs a day · An option nobody would take · At least five hundred and seventy-one · Equal in every company · Fifty-two errors and seven sizes · How rare it is to be bigger · Nobody has to move · Nothing worth fighting over · The fight never runs backwards · The first theorem, and the winner it declines to name · The operator that puts the star back · The other way to move a row · The simplest game above both · The thirty that cancel themselves · The values that are their own negatives · Three players and no answer · Two people, four years apart, one theorem · What is left when the small change is thrown away · When a switch is not a switch · Where the order and the sum disagree · Who moves last · Start at the end and work backwards
0 | −1 0 | −1 N One of four questions · The fight never runs backwards · Where the order and the sum disagree
1 1 L A rule with no promise at all · Cooling adds and heating does not · How rare it is to be bigger · Misère play has no negatives · Nobody wants to move here · Numbers avoid numbers · One part that never ends · The fight never runs backwards · The first theorem, and the winner it declines to name · The other way to move a row · The sum is the object · The values that are their own negatives · Three players and no answer · Which part to move in · Who moves last · Start at the end and work backwards
1 | −1 1 | −1 N A self-negative value costs a day · At least five hundred and seventy-one · The fight never runs backwards · The thirty that cancel themselves · The values that are their own negatives · What a number does to a fight · Where the order and the sum disagree
1 | 0 1 | 0 N One of four questions · The fight never runs backwards · Where the order and the sum disagree
1/2 1/2 L Below zero · Canonical form · Comparing positions · Cooling adds and heating does not · Cooling by exactly one · Equal in every company · Turn the board through a right angle · How hot a day gets · Misère play has no negatives · Nobody comes back · Nobody wants to move here · Numbers avoid numbers · The fight never runs backwards · The operator chosen for one game · The operator that puts the star back · What is left when the small change is thrown away
1∗ 1∗ L The fight never runs backwards
2 2 L Turn the board through a right angle · Misère play has no negatives · Nobody wants to move here · The fight never runs backwards · Two misère outcomes are not enough

Where it is called

Changing this generator changes every one of these figures.

Folding a 4×4 board by its symmetries. The size of a Domineering solver's table when positions related by a board symmetry are stored once. The saving rises toward the size of the symmetry group and stops there — it is a constant factor by construction, and no board is large enough to make it anything else. What it costs

What counts as the same position, and what that is worth

Folding a 4×4 Domineering board by its symmetries takes the table from 5,700 entries to 1,522 — a saving of 3.75, against a ceiling of exactly 4. An orbit cannot be larger than the group acting on it, so this is the one saving in the subject that can never change an exponent.

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

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 form is, and how old its value is. Every one of the 256 forms born by day two, placed by the depth it is written at and by the birthday of the value it carries. Nothing sits above the diagonal, because a form cannot be younger than the value in it; the diagonal holds the forms written at exactly their value's birthday, and everything below it is a position written older than it needs to be. The count in each cell was obtained by canonicalising all 256 forms and measuring both depths. Values

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.

The fight never runs backwards. Each of the 22 values born by day two, drawn from its right stop to its left stop — what Right gets moving first, and what Left gets moving first, once the fight has been played out to a number. Every bar runs the same way. The left stop is never below the right one, which is what "both players are trying to improve their own position" amounts to, and the cold rows, where the two coincide, are drawn as a single point. Values

The fight never runs backwards

Left's stop is never below Right's — in every one of 1,780 distinct values, computed twice by two independently written routes, with nothing that disagreed anywhere. The inequality is what makes a mean value well defined and a fight a fight; and where it collapses to equality, 433 of the 460 cold positions turn out not to be numbers at all.

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

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

The values the construction hands down, and the values games produce. The two lists counted against each other. The construction produces 1,474 values by day three; the eleven thousand positions swept here produce 1,193, and only 116 of those are on the construction's list. A value's birthday and a value's reachability have nothing to do with each other. Values

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.

How many options a value needs. The canonical form is the smallest form of its value, so the number of options it carries is a property of the value. Three days of the construction, with the widths that occur and the widest value of each. Values

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.

What a value costs to write down. Every one of the 1,474 values born by day three, grouped by the width of its canonical form, with the number of symbols the form takes when it is written out. Each count was obtained by walking the canonical form and counting its nodes, so a subposition appearing twice is counted twice — which is what writing it out does. The widest values of the day are not the longest to write. Values

What a value costs to write down

The canonical form is the smallest form of its value, and it is smallest in the one currency the reduction happens to spend: options. Counted in symbols it is nothing of the kind — the widest value born by day three is not the longest, the longest has six options rather than seven, and every canonical form on the day except the seven integers writes some position out twice.

The identity that would join the order to the addition. Every pair of the twenty-two values born by day two, asked whether the join plus the meet equals the sum. It holds on all 201 comparable pairs, where the join is the larger and the meet the smaller and it cannot do otherwise, and on none of the 52 incomparable ones. Values

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.

What a day of canonical forms costs, written out and written once. Three costs for the values born by each of the first three days: every node written every time it occurs, every distinct subposition of a single form, and every distinct subposition of any form of the day. The last is one node per value, and the gap between the first and the last widens as the construction goes on. Values

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.

How much of the value the colon respects. Every form whose option lists are antichains of day-two values, grouped by the value it reduces to, and each group asked whether all its forms give the same ordinal sum with star. On 636 of the 640 groups they do. Sums and comparison

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.

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