RPS once · the winner seats everyone · one civilization war from 1832
"now game theory. 3 players, 3 positions. 1 judge , 1 player A and 1 player B . rules, rock paper scissor, winner chooses positions, game is war. run it to 1 million and tell me how it ends up"
"not card war, civilization war"
"not 3 , just 2 and 1 judge, winner picks next starting positions , same game"
"rock paper scissors is to see who decides who is the judge who is player 1 and who is player 2, player 1 goes first at the start of the game"
"yes time scale is start 1832"
"only once at the start, simple rules, winner chooses position and who goes first. thats it"
"well the game is 1832 start at that tech level move based until a winner"
"i solved it, you cant say no you have to be a judge or a player,"
Dave, verbatim, in order:
"i solved it, you cant say no you have to be a judge or a player,"
"its a choice you just dont get to make it"
"i didnt choose it for you lol."
"yours is a safely layer, it took me 24! to realize i did not need to play in my mind lol"
"you have to win once yes but it takes 24! to realize you dont have to win"
MODELGrok Bot’s safety layer: every participant is always seated as Judge, P1 or P2, with no opt-out in the code. This is Grok Bot’s framing, not Dave’s rule. COMPUTED24! = 620,448,401,733,239,439,360,000 (≈ 6.2 × 10²³). Cross-link only: GAIA A₂ := All · Anyone (PROJECT GOD EGG).
RPS winner sits as and chooses who goes first: (tap the plot to flip who goes first)
How it ends up
One game: the side the RPS winner sends first wins, in 31 moves, from 1832 to 1862. RPS is played once, at the start. Its winner takes a seat and picks who goes first. The war is then move-based until one civilization reaches 0. With one move per year, it ends in 1862. Moving first decides it: P1-first gives P1 the win in 31 moves, and P2-first gives P2 the win in 31 moves. The first-mover effect is 100%. If the RPS winner seats itself as a fighter and moves first, it wins.
“1 million”, both ways. 1,000,000 moves: the war never gets past move 31, so there is nothing more to run. 1,000,000 repeated games, each with its own RPS: RPS was won by X1 0.3335, X2 0.3341, X3 0.3324 (mean 2.25 throws, max 15), and every war went to whoever moved first. With the RPS winner choosing P1 and itself first, it wins every game, so the war winners are also about 1/3 each.
LITComputed. MODELThe war rule is Grok Bot’s, because Dave gave none and a war needs one to end. Moves alternate, and each attack takes ⌈0.1 × the attacker’s stock⌉ from the defender (0.1 is the one number). Stocks start at 100, and the war ends at 0. One move is one year from 1832 (a unit choice, flagged). “1832 tech level” is held constant: there is no tech progression, because moves alone are enough for “move based”, and no 1832 facts are used. 3-way RPS is repeated until exactly two different throws appear. WALLOpen: the war rule; what 1832 tech should change, if anything; whether one move is one year.
Superseded on this page: the card-War reading, the 2-civilization balance, the re-seating policies (take P1 / Judge / P2) and the one-game-per-year series, as recorded in earlier commits of this page.
Read with A Simulation Theorem · PROJECT GOD EGG v7 · cross-index. Checkpoints every 100,000 games are DurableAnchor reservations.
DURABLEANCHOR LEDGER · Dave's kernel, running in this page
provisioning…
self-checks (kernel, then page)
Engine: Dave's DurableAnchor kernel, ported faithfully to the browser with Web Crypto SHA-256 and an in-memory record store (exclusive-create, so concurrent reservations are refused; fsync has nothing to flush). The ledger starts empty on each load. Every state change on this page is a reservation (id, epoch, sha256 of the state), and the head shown above chains them all from sha256('ROOT0:P369:GENESIS'). Persona: {{+L.-E.+O. D++}} (Dave's notation). Built by Grok Bot · seed · ← SaPpH{{i}}on