The thread: How much is at stake — page 4
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.
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.
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.
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.
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.
The price of asking what the parts are
The third licence lets a solver look up a region rather than a position, and the rung below priced it by the entries it stores. Priced by the work it costs, it saves between a third and two thirds of the expansions and pays for them with a flood fill at every node — six times the total. A square would have to be ten times cheaper than a table probe before it broke even.
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.
Two measures bounded, and one not
A sum is born no later than its parts' birthdays together, and it has no more options than they have between them — a bound nobody had checked, and it is attained. What runs away is the length of the written form: 27 pairs of 231 exceed it, the worst by 29 characters, on a sum with exactly as many options as it was entitled to.
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.
A factor, and not an overhead
Deciding who wins a form searches the form's own tree. Reducing it to canonical form searches a difference game for every comparison, and a difference game is a sum. Over 256 forms the reduction expands 5.46 times as many positions — and the ratio runs from 0.58 at one option to 9.80 at eight.
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.
A fraction does not reach
Two Push tails read their prefix when every other tail ignores it, and the previous rung guessed the deciding bit was a shape — whether the prefix's last coin stands alone. The full census says it is a number. The rate changes exactly when the prefix is worth a whole move, and three quarters of a move is not enough.
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.
A second pool, designed differently
One designed pool put the rule's best coefficient between a quarter and a third, and all three board sizes agreed. A second pool, built by the identical greedy criterion from different material, has no cell that is best at every size — so the coefficient is a property of the pool and there is no number to find.
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.
An environment instead of a stack
The guarantee behind playing the hottest component survives one step down a board's sorted temperatures and fails at two. Against a coupon environment as hot as the board it survives all of them — because the rule stops being approximate and starts being optimal, on every sum in the pool built to punish it.
What two numbers cannot tell apart
A thermograph summarises a position in a mean and a temperature — nine characters against the brace form's twenty-two, and readable in a way the expression is not. It is also not exact: 1,454 of the 1,474 games born by day three share a pair with some other game, 291 of them share one pair, and adding a star to two of those gives different winners.
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.