Spivey's three-player War

What Lean checks

Distinct ranks and round-robin deal sizes; exact transition rules; returns after 90, 180, and 19,320 turns; no earlier positive return; all three players active at every nonnegative time.

Collection · Catalogue · Verification · Lean status

Result

Spivey (2010), Q5: three winner-first conventions admit cycles with all three players active.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/spivey-multiplayer-war/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

The stated result is marked formally verified. See the status report for checked scope and remaining dependencies.