Hanoi optimum is 2^n − 1
Theorem.Hanoi optimum is 2^n − 1 — T(n) = 2ⁿ − 1 — BFS graph distance, minimal for every n ≤ 8.
Proof.full-state BFS proves MINIMALITY for every n ≤ 8 — graph distance, not induction; the all-n recurrence cited.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveEight
1 · Classification
finite-complete — computed witness within a cited frame (the unbounded form leans on the cited literature)
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Hanoi optimum is 2^n − 1" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveEight.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveEight @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveEight (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.