Combinatorial Game Theory
who wins, and by how much
Series

Switches — the series

10 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. A switch, its mean and its temperature. Positions of the form {a | b} with a above b: both players want to move there, so neither is settled. The bar spans the two options, the marked point is the mean the position is worth once the fighting is over, and the temperature is half the gap — which is exactly what moving first is worth.

    Worth nothing, and worth fighting for

    A switch is a position both players want to move in. Its average value can be zero while the difference between getting there first and second is enormous, and that gap is a second number every position carries.

    part 1 · values
  2. What a deeper position does to the shape. Thermographs side by side, two of them, with temperature running up each panel and value across it: {{6 | 2} | {1 | −3}}, with a bend where an option's own fight cools out; {4 | −1}, straight-walled. A wall that runs straight has nothing changing hands below the meeting point; a bend is an option's own fight cooling out at a lower temperature than this position's, and it is where a decision passes from one player to the other. The two marks on each base line are the stops — what each player gets by moving first with no tax charged.

    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.

    part 2 · values
  3. Where a switch stops being a switch. The same Left option with the Right one raised past it. While the Left option is above the Right one both players want to move, the bar spans a real fight and the temperature is half the gap. Where the two meet the position is the number plus a star — no longer a switch, and not a number either. Above that the simplicity rule takes over: the value is the simplest number strictly between the options, and there is nothing to fight about.

    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.

    part 3 · values
  4. The switch formulas, off the hypothesis they were stated for. Values born by day three with exactly one option a side, split by whether both options are numbers. On the twenty-one that satisfy the textbook hypothesis the midpoint and half-gap formulas are exact; on the 146 that do not, the same formulas read off the two stops instead hold about three quarters of the time.

    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.

    part 4 · values
  5. The bend decides it. Whether the stop reading gives the mean and temperature, against whether either wall bends below the meeting point. Both off-diagonal cells are empty on all 138 values.

    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.

    part 5 · values
  6. The error is half the follow-up. Each bent value's true temperature, the temperature the stop reading gives it, the difference, and half the temperature of its hot option. The last two columns agree on every value.

    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.

    part 6 · values
  7. The correction on eleven times the pool. The stop reading and the corrected stop reading scored against the true temperature over every non-number value born by day three. The correction was measured on thirty-two values and holds on three hundred and forty-eight.

    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.

    part 7 · values
  8. The wall as an envelope. A thermograph with each option's contribution to its wall drawn over it, built from that option's two stops alone. The wall is the envelope of those contributions and it bends where the envelope has a corner.

    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.

    part 8 · values
  9. How many levels, and how often. Every value in both pools by the number of levels of the recursion its thermograph needs before the stops suffice.

    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.

    part 9 · values
  10. The chain, scored. The chain reading of the level count against both pools.

    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.

    part 10 · values

All series