For every odd n, the game TER(C_n) has nim-value 0.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every odd n, the game TER(C_n) has nim-value 0. Open residue: First unchecked odd n is above 21.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 4/5
Exact dynamic programming has verified odd cycles through n=21; the state space is finite for each n and counterexamples are directly checkable.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 4/5
Verification note
Compute the game graph and Sprague–Grundy values, retaining a full move table as the certificate. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.