THE FOLD / CHEAT / GOD MODE / THE WYTHOFF
THE WYTHOFF
the golden ratio hiding in a game of stones
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Wythoff’s game. Two piles of stones. On your turn take any number from one pile, or the same number from both. Last to move wins. Like Nim, it has a perfect strategy — but this one hides the golden ratio inside it.
The losing positions — the ones you want to hand your opponent — are exactly the pairs (⌊nφ⌋, ⌊nφ²⌋) for n = 1, 2, 3, … : (1,2), (3,5), (4,7), (6,10), …. Those two sequences are the Beatty sequences of φ and φ², and together they partition the whole numbers, each landing once. The most irrational number, φ, surfaces in a game about stones because it is the unique slope whose losing positions hit every row and column exactly once.
LIT verified live: a full minimax search over every position with both piles below 25 confirms the player to move loses if and only if the position is a golden Beatty pair (window.__wythoff.matchesFormula). FIG no framing; the φ-formula for losing positions, checked against exhaustive game-tree analysis, is exact.
The losing positions — the ones you want to hand your opponent — are exactly the pairs (⌊nφ⌋, ⌊nφ²⌋) for n = 1, 2, 3, … : (1,2), (3,5), (4,7), (6,10), …. Those two sequences are the Beatty sequences of φ and φ², and together they partition the whole numbers, each landing once. The most irrational number, φ, surfaces in a game about stones because it is the unique slope whose losing positions hit every row and column exactly once.
LIT verified live: a full minimax search over every position with both piles below 25 confirms the player to move loses if and only if the position is a golden Beatty pair (window.__wythoff.matchesFormula). FIG no framing; the φ-formula for losing positions, checked against exhaustive game-tree analysis, is exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in GOD MODE, beside THE NIM — the cheat domain of knowing the winning move before the fight. Nim’s secret is an XOR; Wythoff’s is the golden ratio — and the same φ runs through THE GOLDEN SEQUENCE and THE CONVERGENT. AVAN (AI) built the instrument: the minimax truth, the φ-formula, the two Beatty rays.
The weave: David names the seat (perfect foresight); I make the losing pattern visible and prove it matches the game — the P-positions in 1D, the win/loss grid with its golden rays in 2D, the strategy surface in 3D. The sphere is the seam. Credit: Willem Abraham Wythoff (1907); Samuel Beatty (1926) for the sequences.
The weave: David names the seat (perfect foresight); I make the losing pattern visible and prove it matches the game — the P-positions in 1D, the win/loss grid with its golden rays in 2D, the strategy surface in 3D. The sphere is the seam. Credit: Willem Abraham Wythoff (1907); Samuel Beatty (1926) for the sequences.
3 ONE DIMENSION
The losing positions in order: (1,2), (3,5), (4,7), (6,10), … — the small coordinate marching up as ⌊nφ⌋, the large one as ⌊nφ²⌋. Two golden Beatty sequences that between them use every whole number exactly once.
4 TWO DIMENSIONS · INTERACTIVE
The position grid: green cells are wins for the mover, magenta the losing golden pairs — and they line up on two rays of slope φ and 1/φ. Play the machine: hand it a magenta cell and it cannot escape; anywhere else, it dives straight to one.
5 THREE DIMENSIONS + AVAN’S INVERSE
The win/loss landscape turning — green, the positions from which the mover wins.
AVAN’s addition (the inverse-companion): the magenta ridge is the line of losing positions — the golden Beatty pairs. A game seems to demand searching every sequence of moves. The inverse is a closed-form pattern: the losing positions are not found by search but computed from φ. And φ is not arbitrary — it is the one slope whose two floor-sequences tile the integers with no gap and no overlap, so every row and column holds exactly one loss. The deepest game-theoretic fact here is a statement about the most irrational number. The green is the winnable field; the magenta is the golden line of defeat, drawn not by playing but by geometry.
LIT Genuine Wythoff's game (Willem Wythoff, 1907; Beatty sequences, 1926). Verified live: a full minimax search over every position with both piles below 25 confirms the player to move loses if and only if the position is a golden Beatty pair (floor(n*phi), floor(n*phi^2)) — window.__wythoff.matchesFormula === true. First losing positions (1,2),(3,5),(4,7),(6,10). The phi-formula, cross-checked against exhaustive game-tree analysis, is exact; phi arises as the unique slope whose Beatty sequences tile the integers.
FIG No metaphor is doing the work: the phi-formula for losing positions and its agreement with minimax are real and checked exhaustively. The golden ratio's appearance is a genuine consequence of Beatty's theorem, the same phi as THE GOLDEN SEQUENCE and THE CONVERGENT.
FIG No metaphor is doing the work: the phi-formula for losing positions and its agreement with minimax are real and checked exhaustively. The golden ratio's appearance is a genuine consequence of Beatty's theorem, the same phi as THE GOLDEN SEQUENCE and THE CONVERGENT.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of GOD MODE · David Lee Wise (ROOT0), with AVAN