catch_up_value_icc_eleven
theoremverifiedformalization
Catch-Up on {1, ..., 11} is a draw under optimal play (the case N = 11 of the Catch-Up conjecture), established by the kernel through the pruned search.
Statement
theorem catch_up_value_icc_eleven : catch_up_value (Finset.Icc 1 11) = .draw- Formalizes
- Catch-Up: A Game in Which the Lead Alternates (Game & Puzzle Design 1(2), 2015), Sec. 3.1 and Table 2: optimal play on {1,...,N} was computed (minimax with alpha-beta pruning) to be a draw for every N <= 20 with even total; this is the case N = 11, re-checked by the Lean kernel
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- catch_up_valueThe outcome of Catch-Up played on the finite set S of natural numbers, from the first player's point of view, assuming optimal play by…
- catch_up_value_icc_eq_draw_of_searchIf the pruned search on [1, ..., N] from scores 0, 0 at the opening move finds no forced win for the first player but finds that the first…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Catch-Up on {1,...,11} is a draw (kernel-checked). -/theorem catch_up_value_icc_eleven : catch_up_value (Finset.Icc 1 11) = .draw := catch_up_value_icc_eq_draw_of_search 11 (by decide +kernel) (by decide +kernel)