Generalized reflectional periodicity conjecture for odd Inverse k-cross games

Let k=2m+1k=2m+1 with m1m\geq1, and consider an Inverse kk-cross game with empty-board state [a][a]. Let G([a])\mathcal{G}([a]) denote its Sprague–Grundy value, and let \oplus denote nim-sum. Generalized reflectional periodicity conjecture. For every such game, G([a])1\mathcal{G}([a])\leq1, and

G([2+3m+a])=G([a])(mmod2),\mathcal{G}([2+3m+a])=\mathcal{G}([a])\oplus(m\bmod2), G([2+5ma])=G([a])(mmod2).\mathcal{G}([2+5m-a])=\mathcal{G}([a])\oplus(m\bmod2).

For k=2k=2, eventual periodicity is known through the identification with Dawson's Kayles, whereas for even k>2k>2 eventual periodicity is unknown; the asserted uniform bound and reflectional periodicity for odd constraints remain conjectural.

Sources & referencesView supporting material

Primary source

Kai Liang and Muxi Li, “A Weak Solution of Inverse Treblecross”, arXiv:2604.16759 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.