THE FOLD / CHEAT / GOD MODE / THE PENNEY
THE PENNEY
pick any coin-triple, the second player beats it
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Penney’s game. You and I each pick a sequence of three coin flips — say HTH. We flip a fair coin over and over until one of our two patterns shows up in a row; whoever’s pattern appears first wins. It looks perfectly symmetric. It is not.
Whatever you choose first, I can always choose a sequence that beats yours more than half the time — going second is a huge advantage. Conway’s rule: to beat your ABC, I pick (not-B) A B. If you pick HHH, I pick THH and win 7 games out of 8. The sequences are nontransitive, an endless rock-paper-scissors: every sequence has another that preys on it, so there is no best choice at all. Pick anything and something beats it.
LIT verified live (seeded simulation): the second-player counter beats every one of the 8 first-player sequences with probability > 1/2, and HHH-vs-THH comes out near 7/8 (window.__penney). FIG no framing; the second-mover win and the nontransitivity are genuine simulated facts.
Whatever you choose first, I can always choose a sequence that beats yours more than half the time — going second is a huge advantage. Conway’s rule: to beat your ABC, I pick (not-B) A B. If you pick HHH, I pick THH and win 7 games out of 8. The sequences are nontransitive, an endless rock-paper-scissors: every sequence has another that preys on it, so there is no best choice at all. Pick anything and something beats it.
LIT verified live (seeded simulation): the second-player counter beats every one of the 8 first-player sequences with probability > 1/2, and HHH-vs-THH comes out near 7/8 (window.__penney). FIG no framing; the second-mover win and the nontransitivity are genuine simulated facts.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in GOD MODE — the cheat domain of the unfair advantage that always works. Penney is god mode for the second player: name any sequence and I have a guaranteed favourite-to-win reply. AVAN (AI) built the instrument: the flip-stream race, the live win-rate tally, the nontransitive-cycle inverse.
The weave: David names the seat (the always-wins second move); I make the counter beat every choice and expose that there is no best sequence — the coin stream in 1D, the live match in 2D, the beat-cycle in 3D. The sphere is the seam. Credit: Walter Penney (1969); the odds algorithm by John H. Conway.
The weave: David names the seat (the always-wins second move); I make the counter beat every choice and expose that there is no best sequence — the coin stream in 1D, the live match in 2D, the beat-cycle in 3D. The sphere is the seam. Credit: Walter Penney (1969); the odds algorithm by John H. Conway.
3 ONE DIMENSION
A stream of coin flips. Your sequence and the counter each “win” the moment they first appear in the run — and across many streams the counter tends to complete first. One race, drawn on a line.
4 TWO DIMENSIONS · INTERACTIVE
Pick your sequence; the counter appears automatically by Conway’s rule. Run many matches and watch the tally — the counter’s win rate climbs above 50% and settles near the known odds (up to 7/8 against HHH or TTT).
5 THREE DIMENSIONS + AVAN’S INVERSE
The eight sequences as nodes; a green arrow runs from your pick to the counter that beats it — the second-mover’s guaranteed reply.
AVAN’s addition (the inverse-companion): the magenta arrows close the loop — the “beats” relation runs in a cycle, not a line. The natural inverse question is ‘which sequence is best?’ — sort them, crown a winner. But there is no winner: the relation is nontransitive, so any attempt to rank them best-to-worst runs into a magenta arrow pointing back. The inverse of a total order is a cycle, and Penney’s game lives in the cycle. That is exactly why going second wins: you are never choosing the ‘best’ sequence — there isn’t one — you are choosing the specific predator of whatever your opponent just committed to. Green is your one guaranteed counter; magenta is the ring that proves no counter is safe from its own. To rank them is to chase your tail.
LIT Genuine Penney's game (Walter Penney 1969; odds algorithm by John H. Conway). Verified live with a seeded simulation: the second-player counter (not-B, A, B) beats every one of the 8 first-player sequences with probability > 1/2, and HHH-vs-THH comes out near 7/8 (window.__penney.counterBeatsAll && hhhNear7of8). The second-mover advantage and the nontransitivity are genuine simulated facts matching Conway's exact odds.
FIG No framing: the always-winning second move and the nontransitive beats-cycle are real, reproduced by seeded simulation and matching known exact odds (7/8, 3/4, 2/3). The counterintuitive true fact — that there is no best sequence because the relation is a cycle, not an order — is the genuine mathematical content, shown directly in the graph.
FIG No framing: the always-winning second move and the nontransitive beats-cycle are real, reproduced by seeded simulation and matching known exact odds (7/8, 3/4, 2/3). The counterintuitive true fact — that there is no best sequence because the relation is a cycle, not an order — is the genuine mathematical content, shown directly in the graph.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of GOD MODE · David Lee Wise (ROOT0), with AVAN