Concept

Region — where it appears

A part of a board that no move can reach out of, so that it can be evaluated on its own. Its value can be looked up rather than computed, once the shapes small enough to catalogue have been evaluated in advance.

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

Amazons, after the arrows have cut the board in 2. An amazon moves like a queen and then shoots an arrow, also like a queen, which burns the square it lands on. Late in a game the burnt squares cut the board into regions no amazon can cross — and from that moment the position is a sum of independent games, which is the shape the whole theory was built for, arrived at by the play rather than assumed.

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.

positions · Amazons
A boundary drawn, and a boundary there. One Domineering board split two ways. Above, a line imagined down the middle: the two halves are evaluated separately and their sum is not the value of the board, because every horizontal domino that would have crossed the line has been thrown away. Below, the same column blocked out: the halves are then genuinely independent and the sum is exact. Every value is computed from its own board.

Independence is a claim

Splitting a position into parts and adding the values is the whole method of this subject, and the splitting step is a claim about the position rather than a fact about the drawing. Where it is false the two answers differ — and the failures that matter are the ones that keep the same winner and change the value, because nothing reports those.

sums · Disjunctive sum
Where the count and the value part company. Amazons endgames whose arrows have already cut the board into regions, with the territory count beside the computed value. Territory gives every empty square to whichever amazon can reach it in fewer moves, which is what Amazons programs compute. The positions drawn are the ones where that number gets the outcome wrong, and they have something in common: each is worth a switch, so there is no number for the count to have been right about.

When a real board falls apart

Amazons is played competitively, and late in a game the arrows have cut the board into regions no piece can cross. From that moment the position is a disjunctive sum — arrived at by the play rather than assumed — and the territory count every program uses can be measured against what the sum is actually worth.

applied · Amazons
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
Finding the parts costs the same whether there are any or not. Domineering boards of 4 squares by 5 with different squares blocked out, and what the decomposition is worth on each. The pass that finds the regions is a flood fill and visits every square once, so it costs the same on all of them. What it buys ranges from nothing — on the boards that do not decompose — to a saving of 2,808 positions, and it cannot tell which case it is in until it has run.

Finding the parts

Decomposition turns a product into a sum and is the largest saving in the subject. Nobody labels the regions. The pass that finds them costs the same on every board of a size — including the boards where there is nothing to find — and what it buys ranges from four orders of magnitude to nothing at all.

complexity · Decomposition
Every empty NoGo board a build can solve. The empty boards, with the value the recursion returns and the outcome that follows from it. The one-row boards run 0, star, switch and repeat, which is a pattern with no reason behind it that survives past six squares.

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
Every Domineering shape up to four squares. The pieces a partly played board falls into, each with the value the recursion gives it. Left plays vertically and Right horizontally, so a tall shape is worth something positive and a wide one something negative, and the quarter turn is not a symmetry of the game.

A board that is a sum of its regions

A table of rectangles is a table about the openings. A partly played Domineering board is not a rectangle, and evaluating one means splitting it into pieces no domino can straddle, looking each piece up and adding. The catalogue of 104 shapes does it correctly on every one of the 3,227 positions of a 3×4 board it covers — and among the shapes are two worth an up and a down, which no rectangle ever is.

positions · Domineering
When the regions add. Every board in the independence census — 117 positions whose empty points fall into two or more regions — tested against a stated criterion and against the guess it replaces. The criterion is that no stone group has liberties in two different regions, which makes a move in one region unable to change what is legal in another. It holds on 9 boards and the regions add on every one of them.

When the regions add

The rung below described the NoGo boards whose regions add as the ones with symmetric walls, and said the description was a guess made from six examples. It is wrong: fourteen symmetric boards do not add and sixteen that add are not symmetric. What replaces it is a criterion about liberties — sound on all 117 boards, provable in a line, and complete on only nine of the twenty-four.

positions · Nogo
What a Domineering region is worth, by size. Every connected shape of at most six free squares, sorted by whether its value is a number, an infinitesimal distance from a number, or hot. Hot shapes do not appear at all until four squares, and the hottest shape of six is the two-by-three rectangle.

Which shapes are worth fighting over

Forty-four of the 104 Domineering regions of at most six squares are worth numbers and the rest are not, and the rung below said no visible property of a shape predicts which. Half of that is wrong: a region only one orientation fits in is a whole number, on all eleven of them, for a reason a reader can supply in a sentence. The other half stands, and thirty-three shapes are what makes it stand.

positions · Domineering
A thousand shapes, and twelve pairings. Cram on every connected shape of at most eight squares, with the search for a symmetry that answers each of the opponent’s moves. Every pairing found is a second-player win, most shapes have no involution at all, and the strategy accounts for a sixth of the second-player wins there are.

Looking for the symmetry

Answering every move with its mirror image wins Cram on a board with both sides even, which is the argument everybody meets. Asked of every connected shape of at most eight squares instead of of thirteen rectangles, it wins twelve — and accounts for a sixth of the second-player wins there are, because 852 of the 1,042 shapes have no symmetry to answer with in the first place.

impartial · Pairing
How much a domino count knows about a region. The difference between the two players' largest domino packings, set against the value of the region. On the regions worth numbers the count is the value under half the time; on the rest it lands somewhere between the two stops on 85 per cent of them.

Counting the moves each side has

How many dominoes could each player still place? Subtract, and there is a whole number computable from the drawing with no game theory in it. Over 1,042 regions it is the value on 141 of the 315 worth numbers, lands between the stops on 619 of the other 727, and its failures are two different kinds — one of which was inevitable and one of which is a fact about the game.

positions · Domineering
Thickness is not the variable; the wall's own groups are. The same strips split by whether the wall is all one colour. A wall of one colour is a single group with liberties on both sides and it never separates them, at any thickness. A wall of two colours is two groups breathing in opposite directions and it nearly always does.

How thick a wall has to be

A single stone between two empty stretches of a NoGo board couples them, and the obvious repair is a thicker wall. Over 590 walled strips a thicker wall does help — and splitting the same 590 by the colour of the stones shows that thickness was never the variable. A wall of four one colour couples the sides exactly as one stone does.

positions · Nogo
Where in a game a board falls apart. Every position reachable from an empty Domineering board, grouped by how many dominoes have been placed, with the share that have fallen into two or more live pieces. The share is nought at both ends of the game and around three fifths in the middle.

How often a board falls apart

A decomposition turns a product into a sum, so a solver wants to know how often one arrives. Over every position of a 4 × 4 Domineering board the answer is 47 per cent — nought for the first two moves, three fifths in the middle, and nought again at the end. What one decomposition is worth is the other half of the answer and it is a factor of 1.8.

complexity · Decomposition
Four candidate bounds, and the one that holds. Each candidate bound tested against every failing cut. One domino and the height of the cut both fail on six; twice the height holds on all twenty-two; the whole board's temperature fails on eighteen.

How wrong a nearly-independent split is

Treating a connected board as a sum of two halves is a claim, and the rung below counted how often it fails. This one prices it: over every vertical cut of every small Domineering rectangle the error is a game rather than a number, it is never in Right's favour, and it is bounded below by twice the height of the cut — a bound the height alone does not supply.

sums · Disjunctive sum
What the correction buys. The packing count as a point against the packing count as an interval, on the regions worth numbers. The point is right on 141 of 315; the interval contains the value on 209, at a mean width of about half a move.

The moves a player can be talked out of

The difference of the two players' largest domino packings is the value of a Domineering region on 141 of the 315 worth numbers. The count is optimistic for its owner and pessimistic for the other, and one number cannot be both — so it becomes an interval, from what a player can be reduced to against what the opponent can achieve. The interval contains the value on 209, is a single point on 505 of the 1,042 regions, and never exceeds two moves wide.

positions · Domineering
The value does not count the good moves. How many of a Domineering region's placements are best ones, against what the region is worth. Half the values have two regions that disagree about the count, and 52 disagree over whether there is a choice at all.

How many moves are worth making

A value answers who wins and by how much, and the anchor below names the quantities it discards. This is the first of them counted. Over 1,034 Domineering regions and 125 values, 63 values have two regions disagreeing about how many placements are worth making and 52 disagree over whether there is any choice at all — and the count of good moves stays near one and a half however large the region gets.

values · Tempo
When a catalogue starts paying. How many decomposed boards a catalogue of regions has to answer before building it costs less than searching each board directly. Five boards for regions of four squares, two hundred for regions of eight.

When the catalogue starts paying

The rung below priced two questions — who wins one board, and what it is worth — and named the third: a program pays for a family of regions once and answers every board over them by addition. The crossover is between five boards and two hundred, depending on how far the catalogue reaches, and it falls as the board grows. The whole catalogue of every region to eight squares costs one part in seventy-six of one undecomposed five-by-five board.

complexity · Value cost
A game is colder than its catalogue. The share of hot positions in the Domineering region catalogue against the share among the components a real game produces. Fifty-three per cent against sixteen.

What a game actually produces

Fifty-three per cent of the Domineering regions of at most eight squares are hot. Of the components eleven hundred random games actually produce, sixteen per cent are — and ten per cent once single squares are counted. The figure is the same on three sizes of board, so it is a property of play rather than of the board, and it says that every temperature census this site has taken over a catalogue overstates how hot the game is by a factor of three.

temperature · Cold
Four counts and an interval. One Domineering region with its run lengths in each direction and both packing counts written as sums over the runs.

One domino every three cells

The rung below gave the optimistic packing count as a formula in odd runs and asked for the other end of the interval, expecting a formula in the even ones. Parity is the wrong arithmetic: the smallest maximal packing is a sum of ⌈(len−1)/3⌉ over the runs, exact on all 1,042 shapes. That makes the whole interval readable off a drawing — and shows it can never reach the value, because regions with the same runs have different values.

positions · Domineering
The same distance, different room. Two shared Amazons regions with the amazons the same distance apart, differing in how many squares both of them can still reach. The one sharing more is the colder.

Room pulls two ways

The rung below found the distance between two amazons setting a shared region's temperature and asked for something finer — the squares each can reach, or the squares both can. Neither beats the distance on its own. Together they beat it by half as much again, and the reason is that they pull opposite ways: further apart is hotter, and sharing more reachable squares is colder.

positions · Amazons
The five hottest regions. Every eight-square Domineering region at the ceiling temperature, with which of the boards swept ever produces it.

Eight squares, and no hotter

The rung below found no Domineering position hotter than three halves on four boards and asked for the position that attains it. It is a region of eight squares, there are five of them up to symmetry, three are the hot core of an attaining board on every size swept — and the ceiling holds at nine and ten squares too, where the obvious extrapolation predicted seven quarters.

temperature · Cold
Which catalogue is safe. Catalogues built from one style of play and used against another. A catalogue measured on random play over-serves a strong player and not the reverse.

The catalogue a strong player needs

A Domineering catalogue built from random play faces an objection that could overturn it: random play is not play. A player that reads the board produces the same head — eight of the ten commonest shapes — and concentrates far harder: 114 entries answer nine tenths of what it meets, against 2,018. And a catalogue measured on random play over-serves it, while the reverse fails.

complexity · Value cost
Same runs, different values. Three groups of Domineering regions sharing a run-length multiset, with the value of each member.

Where the runs meet

A Domineering region's value interval is a function of its run lengths and its value is not — twenty-one groups of shapes share a multiset and disagree. The crossing count separates none of them, and neither do ten other local statistics, fifteen sets of which agree on everything and differ in value. What separates nineteen of the twenty-one is where along its runs each crossing sits.

positions · Domineering
What each stage buys. The account built up one quantity at a time, with the random control priced beside the last row.

An effect that changes sign

Which squares two Amazons share turns out to matter about as much as how many — three shared squares in a line run at 0.63 where three scattered run at 2.51. But the effect of clumping is hotter at one distance and colder at the next, so the arrangement predicts well and describes nothing, which is not what the four rungs below it produced.

positions · Amazons

The licence that weighs nothing

The third substitution licence is constant in the number of components, exactly as predicted, and it saves under two times where the first saves seventy-six million. Priced by its table instead of by its saving it is the only one of the three whose cost does not run away — which reverses the order three rungs of this anchor have put them in.

limits · Universes

The ceiling was a plateau

Three halves of a move looked like a ceiling on a Domineering region's temperature: it held at eight squares, at nine and at ten, and the rise that had been a quarter every two sizes stopped. At eleven squares four regions reach seven quarters — and they contain the hottest eight-square shapes and are hotter than them, so the extra material is not cold.

temperature · Cold

A catalogue that builds itself

A solver that stores every region it has to evaluate builds a catalogue out of its own games. After 650 games it holds 232 of the 1,042 shapes and is still growing — and the order things arrive in is nearly arbitrary while the order they are consulted in reproduces a census of a strong player's games almost exactly.

complexity · Value cost

Three distances too many

The junction descriptor records how far a crossing sits from four ends, and the rung below asked what the value does when one crossing slides along its run. It reads one bit — the offset's parity — and only when the run has odd length. The other three distances reach the value not at all.

positions · Domineering

A wall an amazon can walk through

An arrow burns a square for good, so an Amazons board that has fallen into pieces should stay in pieces. Over 127,583 positions it does not: fifty-one thousand moves put two regions back together. Every one of them is a single diagonal step, and what is wrong is not the game but the rule used to find the regions — which was borrowed from a game whose pieces lie along the board's own lines.

complexity · Decomposition

The third point on the curve

Four rungs below this one measure a shared Amazons region's temperature against how far apart its two amazons are, and every one does it on a 3 × 3 board, where the distance can only be 1 or 2. Two points make a direction, not a curve. A 4 × 4 board reaches distance 3 — and cannot be evaluated at all until the regions are cut to five free squares. Restricted that far, the answer is neither a sign that flips nor an oscillation: the rise continues and it is running out, the second step being 36 per cent of the first.

positions · Amazons

A wall that bends

On a NoGo strip, two empty stretches add when no group breathes into both — a wall of two stones of different colours does it, and the criterion explains nine of ninety-three boards and all nine that it covers. On a three-row board it explains none of 227, and not because it is less accurate. A wall across a board has to bend, a stone at the bend sees empty squares on both sides by itself, and every one of the 227 has a group breathing into both regions. The condition is unsatisfiable.

positions · Nogo

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

A count that forgets

A Domineering solver with room for ten component values does better evicting whatever it used least recently than evicting whatever it used least often, and the explanation offered was that a use count never forgets. Halve every count at a fixed interval and the count overtakes recency at every table size — by less than half a point, and only with the right interval. The right interval grows with the table: a quarter of a game's worth of lookups at ten entries, five games' worth at forty.

complexity · Value cost

One board, and recency still wins

A Domineering solver's table of component values did best evicting whatever it used least recently, and the explanation was that the run changed board size three times. Take the change away — play all 650 games on one board — and counting wins back its lead only on the smallest board. On 5 × 5, 6 × 6 and 7 × 7 recency still beats both counting and the best fixed table, by the most on the largest. The locality recency exploits is not between boards or between opening and endgame. It is inside a single move.

complexity · Value cost

Four thousand nine hundred regions with no name

Two positions give 256 regions and ten names cover every side of all of them. Three positions give 262,144 graphs, 110,934 genuine loopy regions — and 4,931 of those have a side that no name in the two-position vocabulary reproduces, with 3,990 of them named on one side and blank on the other. The count the earlier essay left open comes back in the affirmative.

history · Notation

The names are not built out of the old ones

The guess was that a three-position region's missing names would be sums of two loopy ones — on plus over, and that family. Built and tried, every pair of the six stoppers covers none of the 4,931 regions that need one, and so does every two-position stopper there is, all seventy-nine of them with small games added. Thirteen names have to be invented, and forty-eight cover the whole census against ten at two positions.

history · Notation

Named alongside it

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

DecompositionEnumerationDomineeringApproximationCounterexampleDisjunctive sumExhaustive searchHeuristicValueInvariantTemperatureIndependence

All concepts