Approximation — where it appears
Named by 58 essays across 8 fields — each of them below, with the objects they name alongside it.
The first time it told somebody something
A theory earns its keep when it produces an answer nobody had. Temperature did that for Go endgames — the orthodox account gives a move order that is provably right and is not the one experience offers, and the position it is right about is small enough to check here completely.
A rule that is never right and cannot be far wrong
Playing the hottest component is not optimal — over 440 measured lines it costs something on 17 of them. What makes it worth having is that the cost is bounded by the temperature, provably, and that the same test run with the ordering reversed breaks the bound on 54.
The switch a player is imagining
Every account of a hot position ends up as "worth about m, and worth t to move in", which is the switch {m+t | m−t}. For a plain fight that summary is the position exactly. For a fight with anything behind it the leftover is not a rounding error — on one position here it is a whole second fight of temperature two.
The values that keep arriving
A Grundy sequence that repeats uses finitely many values and stops needing new ones. Six thousand heaps into ·007 the count of distinct values is 187 and still climbing, and the share of heaps carrying something outside the twenty-two commonest rises from 32% in the first thousand to 85% in the sixth. The rare values a periodicity argument needs to thin out are getting commoner.
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.
A rule with no promise at all
Playing in a hottest component comes with a bound: never more than the largest single temperature below the mean of the board. Over 220 sums the bound holds 220 times — and so does the bound for a rule with nothing behind it, which scores exactly what perfect play scores on 205 sums against the hottest rule's 196. The control that shows the bound is doing work is the rule that plays the coldest component, which breaks it 74 times and loses up to eleven points.
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.
The rule the symbols follow
Two genus symbols make a third by three lines and no lookup table: the base exclusive-ors, the sum is fickle only when every component is, and the symbol follows. Checked on 252 pairs across nine games it is right on 238 — and the fourteen failures are exactly the fourteen pairs with a wild heap in them, which is the boundary the genus is defined up to arriving as a measurement.
The question in the middle
Between knowing who wins each part and knowing what each part is worth sits the question a player actually has: who wins the board. Priced on sums of two it lands between the other two on seven of eight, cheaper than the values by up to eight times. On sums of three, with nothing repeated, it is dearer than the values on five of six — because a component multiplies a search and only adds to a value.
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.
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.
A schedule instead of a number
Playing in the hottest component loses at most the largest temperature on the board — the classical guarantee, stated against one number. Sorting the temperatures and reading the guarantee one step further down gives a promise 47 per cent smaller that is never breached over 1,734 sums. Two steps down it fails 120 times, so the schedule has exactly one step of slack in it.
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.
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.
The criterion that cannot exist
The rung below asked for a quantitative version of its condition — turn 'the reading survives mixing three quarters of the time' into a statement about the strip. Three strips of four squares settle it. `.LLR`, `.LRL` and `.RLL` have the same length, the same reading, the same coins and the same single run, and their readings are wrong by 1¼, ¼ and ½. The error is a fact about the order of the colours, and 207 of 805 statistical classes carry more than one of them.
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.
The margin a count needs
Leaving the opponent fewest replies names only surviving options nine times in ten, which leaves the question of what a bound stated in that count would have to be weakened to. It is a margin. Over 57,879 pairs of Domineering options, the one leaving the opponent fewer replies is the worse of the two 1,052 times at a margin of one and 72 times at a margin of two — and at a margin of three, never.
The weight that blunts the count
The rung below found that counting the opponent's replies gets the direction of a comparison right once the gap reaches three, and proposed a repair: weigh each reply by whether it leaves the opponent anything. Weighing it makes the count worse. The threshold goes from three to four, the failures from 1,124 to 1,320, and all seventy-two of the pairs the repair was written for come through it unchanged.
Half a follow-up out
The rung below settled which values the stop reading is wrong about — the ones whose walls bend — and left the size of the error unmeasured. It is not bounded by anything readable off the diagram; it equals something readable off the diagram. On all thirty-two, the mean and the temperature are each out by exactly half the follow-up's temperature, and the temperature is always read too low.
Two errors that cancel
Replacing the packing count with an interval left a doubt that the pessimistic half would add across a board. It adds, for a one-line reason. What is worth measuring is what the reading is then worth: over boards of one to four regions the count decays from exact on 45 per cent to exact on 11, and the interval's containment does not decay at all — it rises from 67 per cent to 74, because the interval's width adds and its error does not.
Where to stop building
The rung below priced a catalogue of small regions against the search it replaces and found the crossover. What it could not say is how far to build, and the coverage answers that: going from four squares of reach to ten multiplies the catalogue by 860 and lifts the share of regions it answers from 54 per cent to 74. The price of a point of coverage runs from five shapes to five thousand.
Add, then reduce again
The homomorphism promises that a sum's reduced form can be computed from its parts', and says nothing about what the operation is. It is addition followed by a second reduction — needed on 431 of 3,600 pairs of day-three values, and on not one of the 1,751 pairs with a cold part. What the second pass removes is an option that only becomes dominated once the two fights are side by side.
The threshold was a fact about the census
Two rungs failed to account for the seventy-two pairs where a mobility count gets the direction of a comparison wrong, and the third looks at them one at a time. They are not a class of shapes. All seventy-two are on the largest board in the census, at two depths, and sixteen positions up to symmetry — and one board larger the count fails at a margin of three, which the ladder has been quoting as the point at which it never does.
A second level of stops
The rung below found the stop reading's error to be exactly half the follow-up's temperature and asked whether the correction survives a wider pool, survives two bends, and can be stated without a thermograph. It survives eleven times the pool, missing two values in 1,459. It needs no thermograph — the follow-up's temperature is half its own stop gap. And it does not survive two bends, because day three contains no value with two of them.
The entry fee was the cap
Two rungs measured how much bigger a position has to be than the value it exhibits, and attributed what was left to the ruleset — Toads and Frogs paying 2.25 squares on everything, green Hackenbush paying nothing. Neither number is a property of the rules. Inside every ruleset the excess falls as the birthday rises, because the sweep's size cap censors exactly the values that would pay most — and three squares past the cap, Toads and Frogs exhibits values born later than the strip is long.
Three rules and a tie-break
An exhaustive table of what a Domineering strategy has to remember is 3,308 lines. Three rules applied in order answer 94.5 per cent of it — leave the opponent fewest replies, then keep the region whole, then take whichever placement comes first — and the fourth and fifth rules answer not one more. The residue is 181 decisions in which every rule scores the candidates the same and one of them is worse.
Half the difference in odd runs
The rung below asked what the regions the packing reading fails on have in common, and whether it is something a player could see. It is: the reading itself. The count has a closed form — half the difference between the region's odd horizontal runs and its odd vertical runs — and it is exact seven times in ten when it claims one move of advantage, on none of the largest regions where it claims two, and it exaggerates four times in five when it is wrong at all.
The cliff a cut invents
The rung below asked for a correction term in the gap between two Push runs. There is none, because the gap's contribution vanishes: widen it and the strip's value converges geometrically, at a rate set by the back run's length alone, to a limit that is not the sum. And Shove — whose reading is exact everywhere — fails at the same cut, which says the broken thing is the cut and not the game.
A rule that beats the hottest
The rung below proposed the reverse of the rule that had just failed — discount a component by its answer's temperature rather than promoting it — and predicted, before the sweep, that it would not beat playing in the hottest component. It does. It plays exactly on 201 of 220 three-component boards against 196, wins two thirds of the boards where the two disagree, keeps inside a guarantee proved for the other rule, and the gap widens as the board grows.
The obstacle was the catalogue
The rung below could not measure the early game because its regions were too large for the catalogue, and asked for a bracket rather than a value. No bracket is needed: a twelve-square region evaluates in five milliseconds and an eighteen-square one in under a second. What was expensive was cataloguing every shape rather than sweeping the positions a board actually reaches — and the sweep says a board is hot four times in five three moves in, and cools when it breaks up.
Which end a sum lands at
The rung below found the errors in a translated stop clustered at the two ends of the range its bound allows — 660 at nought and 358 exactly on the bound — and asked for a rule saying which end a given pair lands at. There is one, in four lines, exact on all 1,440 sums. Three of the four cases are decided by the value being translated alone, and the property that decides them is the bend the switches ladder found for a different question entirely.
The option nothing names
The rung below found the arithmetic on reduced forms to be add and reduce again, needing the second pass on 431 of its sums, and asked whether the option that pass deletes can be named from the parts. Eight rules were scored and the best reaches four in five — and on a pool closed under negation it falls to under half, which says the near-miss is a property of the population. What the second pass does have is a shape and a cheap test that rules it out.
The two numbers at the top
The rung below found the crossover of a sente fight to be its temperature less half its answer's, and said a proof would settle the depth question with it. The depth question is settled without the proof, by construction: group the positions by their two top temperatures and the crossover is single-valued on every group, however far apart the third temperature is — and the formula survives a fourth level of fight, which the rung below never reached.
A catalogue that knows what it will meet
The rung below priced a catalogue of regions by its reach and found the coverage saturating, and asked what a catalogue ordered by frequency would cost instead. Eight shapes answer half the components a played Domineering board produces; a catalogue by size needs fifteen for the same, and 1,042 for what 119 chosen by frequency reach. Three quarters of a size-ordered catalogue never turns up in play at all.
Read from the back forwards
The rung below found a two-run Push strip converging at a rate set by the back run and asked what a third run does — whether the rate is still the rearmost run's, or whether the rates compound. It is the rearmost run's, and for every gap: widen the front gap of a three-run strip, two whole runs away, and the value still dies at the last run's rate. Shove, the game one clause away, compounds.
The rate was the alphabet
The rung below asked for a quantity a size cap cannot censor and proposed the rate: how many new values a ruleset produces per extra square. The rate is honest and it measures the notation — every ruleset grows at close to the number of symbols its positions are written in, and the seven span less than a factor of two. What separates them is the yield, which spans a hundred and nineteen.
A threshold is a detection limit
The rung below had two points — a margin of three at fifteen squares, four at eighteen — and asked whether the mobility rule's threshold grows with the board. Eleven more sweeps say no property of a board orders the thresholds, that the same board at two depths gives two of them, and that a tenth of the sweep which produced the four reports three instead. What does move, on every board measured twice, is the depth.
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.
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.
The worst value in its own interval
The rung below scored a component by its temperature less its hottest answer's and asked what rate the answer should really be charged at. Every weight strictly between nought and one scores the same and beats the rung below's choice of one at every board size — because a ranking rule's score is a step function of its own coefficient, and one is exactly where two components tie.
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.
Wrong in one direction only
The rung below asked for the simplified comparison test the dead-ending hypothesis is supposed to license, and predicted it would agree with the quantifier on the dead-ending rulesets and not on Toads and Frogs. Written three ways and scored on 492 pairs, it agrees best on the ruleset that is not dead-ending — and never once refuses a comparison that holds, which makes it a sound filter and not a test.
Two strips that end the same way
If a Push strip's sensitivity is governed by its last run, then two strips agreeing at the far end should behave the same however different their fronts. On 78 of 80 tails they do, exactly. On two of them a single empty square in the prefix reaches across a gap that grows without bound and halves the rate — and the run reading turns out to be sound in one direction only.
A bend that never reaches the surface
How many levels of the recursion a thermograph needs before its stops suffice is a number attached to a position, and the rung below conjectured it was the depth of the deepest bend in the tree. It is not: on 124 values a bend one level down costs nothing at all. What the number counts is the longest unbroken chain of bends running down from the top, exact on 2,400 of 2,403.
A heuristic that becomes a theorem
The mobility rule's failure rate had been measured at two depths on each of five boards and found to fall. Swept at every depth it does not merely fall — it accelerates, and it reaches exactly nought before the endgame. From four to eight empty squares onwards the rule has no exceptions at all, which turns a rule of thumb into a guarantee for the last few moves.
The price of taking the maximum
The seventy-two decisions where a Domineering strategy's rules name the wrong placement are never wrong by more than one reply, and a third of them are the second rule's fault rather than the mobility count's. The repair that follows — keep every placement within one reply of the best — retains a best placement every time and costs thirty decisions for every one it saves.
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.
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.
A pool built to have an answer
The coefficient in the rule score a component by t − λa scored identically for every λ in the unit interval, because the rule reads an ordering and that pool's orderings changed at three places. A pool designed to have twelve crossings turns the interval into thirteen different rules, and all three board sizes agree on one cell: between a quarter and a third.
Where the value stops mattering
Fourteen straight-walled pairs missed the bound on a translated stop and had only a threshold to explain them. Their stops move by exactly the addend's temperature — a formula with the value nowhere in it — which turns the threshold into the boundary between two lines and closes a census of 1,440 pairs that has been open for four rungs.
A pattern that has not started yet
A pre-period was supposed to be rarer in this family than a defect. Two hexadecimal codes in five have one, 321 have a pre-period longer than their own period, and the code the rung below found slow takes fifty-four heaps to settle rather than two blocks — which is also the account of three defects the rung below recorded and could not explain.
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.
Which top is the top
The crossover law's proof rests on the walls above the crossover being governed by the top two options, and the check was never run. Run on 23,586 heights it holds exactly — but only when the options are ranked by mean value. Ranked by the temperatures the law is stated in, it fails on a fifth of them.
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.
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.
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.
The bound names the hottest part and the cost does not
Moving in the hottest component costs at most the largest temperature on the board, and that bound is attained: 100 lines of 4,240 pay exactly it. It is still the wrong quantity. Across four pools and boards of two, three and four parts the cost is nothing on 90.8% of lines and otherwise takes one of two values — half a point or one — on boards whose largest temperature runs to three, and it exceeds the coolest component on 13 lines and twice it on none.
The cheap fights make the rule cheaper
A conjecture stands that playing the hottest part costs at most the coolest temperature times the number of parts sharing it — proposed on a range where that number never exceeds two. Swept to five-part boards over 10,410 lines it is false, and false the other way round: every line costing more than the coolest part has one or two parts at that temperature, and over the 3,230 lines with three or more, not one does.
Named alongside it
The objects these essays reach for when they reach for this one.
EnumerationHeuristicCounterexampleValueTemperatureDecompositionInvariantDomineeringDisjunctive sumBoundThermographMean value