Stops — where it appears
Named by 55 essays across 5 fields — each of them below, with the objects they name alongside it.
Double sente is not a property of the position
A fight with a threat on each side is called double sente, as though the phrase named a shape. Swept against a rising ambient temperature, one such fight — { {5 | 3} | {2 | −4}} — is double sente up to an ambient of 1, sente for one player only from 3/2 to 3, and gote for both from 7/2, and the two band edges are the temperatures of the two follow-ups.
Where the fight stops
Keep taking the biggest thing on offer until somebody is left facing a number, and the number reached is a stop. Every position has two of them, one for each player moving first, and between them they say how a fight ends — except for the part of it no number can reach.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
How cold a sum of hot games can be
The temperature of a sum is at most the largest temperature in it, and the bound leaves the whole interval below it open. Over 1,035 pairs the sums do not use that interval: 864 sit exactly at the maximum, 160 are frozen outright, and eleven land anywhere in between — every one of them with a component whose wall bends.
What a move nobody makes is worth
If Right's move in a fight has to be answered, then Left's move in the same fight prevents an exchange Right was going to get for nothing. That is a reverse sente, and pricing it is the awkward case: over sixty measurements the gain matches the local temperature once and the follow-up's swing twice, and the band over which the move is worth taking is not the band over which the move it reverses is sente.
What is left when the copies pair off
A pile of n copies stays within a bounded distance of n times the mean, and the distance never grows. The difference is a game rather than a number, and what it actually is has a much better answer: for a plain switch it alternates between one fight and nothing at all, and for a fight with a follow-up it is different every time — bounded in size and unbounded in complexity.
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.
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.
When two thermographs can be added
The temperature of a sum is not the sum of the temperatures, and the natural repair is to add the whole diagrams instead. Over every pair of hot values born by day two the added walls always bound the true ones and the mast always comes out right — and the whole diagram is right exactly when at most one of the two components is hot, which is precisely the case a reader has no use for.
A pool built to punish greed
The rung below found a rule with no theorem behind it beating the rule with one, and predicted that a pool of deliberate traps would reverse the result. It does not. The traps miss, because the rule called greedy scores a move by the stop it leaves and a stop already contains the follow-up — and the rule the traps do catch, losing sixteen points where the guaranteed rule loses five, had to be written to make the point.
How hot a background has to be
The reduced canonical form throws away infinitesimals, and the rung below asked for a bound: how hot must the rest of the board be for the discarded part not to matter? There is no such bound. Safety is not monotone in the background's temperature — an eighth is safe, a quarter is not, two is safe again — and the quantity that does decide it is not a temperature but a stop.
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.
The answer that starts another fight
A local move is answered while the ambient temperature stays below the follow-up's — and that rule, which this site has carried since the anchor opened, is exact only when the answer ends the fight. When the answer starts another one the crossover is exactly half the follow-up's temperature, on every position tested, and a third level of fight does not halve it again.
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.
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.
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 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.
A game with nothing at stake
The rung below explained a coincidence with a claim it did not compute: that End-Nim carries no hot self-negative values. The census says something stronger. Not one of 10,919 rows across three shapes of board is hot, every one of them is worth an infinitesimal, and the 361 rows the earlier census called numbers are 361 rows worth nought. The reason is one line of the rule, and 2,693 distinct values sit underneath it.
The bend is the condition
The rung below offered a description of the class its stop reading is exact on — neither wall bends below the meeting point — and a route to proving it: that a bend happens precisely when some option is neither a number nor an infinitesimal. The first is exact on all 138 values, both directions, no exception. The second is half right: every bent value has such an option and 49 unbent ones do too. And the eight apparent exceptions to the first turn out to be a bookkeeping convention.
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.
What a fight does to a fight
A number added to a position shifts both its stops by itself; an infinitesimal moves neither. A hot game does neither: over 720 sums the two stops add on 330 and are wrong on the rest. What survives is the mean, which adds on every one of the 720 — and the failure has a bound, since no stop is ever out by more than twice the smaller of the two temperatures, a bound 222 of the sums attain exactly.
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.
What a strategy has to remember
A value answers who wins and by how much, and it settles neither how many moves achieve it nor whether the best one is unique. Counted over every position reachable inside the catalogue of regions, the gap has a size: 4,269 positions carry 128 values between them, and a player who wants to win rather than to predict has to store 3,308 choices — twenty-six entries for every number the theory supplies.
One fight makes a board a fight
The rung below found 16 per cent of the components a played game produces to be hot, against 53 per cent of the catalogue they are drawn from, and predicted that the share of hot boards would be much larger. Taking the same play-outs and tallying at the board gives 32 per cent — twice the piece figure and not ten times it, because a Domineering board carries only 1.68 pieces and the hot ones cluster on the same boards.
A bound with one number too many
The rung below bounded how far a hot addend can drag a stop — twice the smaller of the two temperatures — over sums whose addends were all plain switches, and conjectured that an addend with a follow-up would need twice the smaller of three numbers. Over 1,440 sums with bent addends the two-number bound holds everywhere and is attained 358 times, and the three-number version fails on 66.
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.
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 bend is in the stops
The rung below reduced the whole stop reading to one question — does this wall bend? — and asked whether that could be answered from the options' stops instead of from a diagram. It can, in four lines, and it gives more than the bend: on all 1,459 non-number values born by day three the options' stops determine the entire thermograph. One day deeper it breaks, and every failure is a value with a bent-walled option.
The same number in two currencies
The rung below found bent-walled values falling strictly inside the translation bound and asked how far. The shortfall is the value's own hottest follow-up's temperature — exactly, on 400 of 408 pairs, and twice it on the other eight — which makes the whole error one expression. And it is the switches ladder's constant: a half there and a whole here, because a temperature is half a stop gap.
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.
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.
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 side about to lose its move
A fifth of the second reduction's work removes the last option a player had on a side, and no rule on the ladder had looked at one — because a deletion with no survivor has no pair in it. The recognisable object is not which option goes but whether the side is one an option can go from, and two comparisons on the parts decide it on all 525.
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.
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 table that changes its mind
The advice that ten entries chosen by use serve nine lookups in ten was untested: it describes a table sorted after the fact rather than a solver that only ever held ten. A solver that only ever held ten gets 94.2 per cent — beating the best ten chosen with the whole run in view, because there is no best ten.
A description, and not a detector
The rung below noticed that the count of shapes attaining the hottest temperature grew across a plateau and collapsed at the step, and proposed it as a way to read a plateau off a single size. The growth is exact — five plateaus, no exception — and the rule is impossible: five orbits precede a rise at seven squares and no rise at eight.
One expression proved, and one withdrawn
The census closed with three expressions exact on 1,440 pairs, and the rung above asked for derivations. The cold one has a four-line proof. The straight one has a threshold the census cannot determine — any constant between 4/3 and 3/2 fits it — and eight more addends of the same family break it on 38 pairs while leaving the bound above it untouched.
The four paragraphs prove something else
Three rungs earned the right to write the crossover law's proof as two straight walls meeting where the law says. The walls are straight — one of them everywhere, for a trivial reason, and the other only above the answer's own temperature. The crossover sits below that height, so the geometry holds nowhere the law is about, and where it does hold it proves the temperature instead.
A cross in the table
Which pairs need a second reduction had never been asked. Sorted by the two temperatures the answer is a cross — the whole gap-of-a-quarter column and the whole colder-is-three-quarters row — and it is exactly necessary on all 431 with no exception, and wrong 477 times in the other direction.
One number, stated two ways
Twice the height of the cut held and was loose; the height alone failed. The smallest true constant is three halves — exact and attained as a bound on how far the value can fall, and an infimum attained nowhere as a bound on the value. The gap between the two is one move.
Close calls nothing resolves
The same value panel that settles 118 of the 202 silent decisions settles four of the seventy-two the rules get wrong. Every rule that helps at all must replace connectivity rather than follow it, and the cheapest one breaks twenty-six decisions for every one it saves.
The bend above the top
The chain reading gets three values in 2,403 wrong because it counts bends that the diagram never reaches. Counting only the bends below the position's own temperature fixes all three and breaks none — the first exact reading on this ladder, and it needs one comparison rather than the envelope the rung below expected.
The residues as a sequence
Four of the eight residue sequences never repeat, and a recurrence is not a description. There is a closed form and it is not for the game: the stops and the temperature of the n-th residue are periodic with period one, two or four on every sequence in the pool, while three of them produce a different game at every n.
Named alongside it
The objects these essays reach for when they reach for this one.
TemperatureMean valueThermographEnumerationCanonical formDisjunctive sumSwitchInfinitesimalExhaustive searchHot gameCounterexampleApproximation