1 problem

0 votes0 replies1 view
The conjecture on P-positions for Slow SetNim with at least $k$ playable stacks
Let $n$ be the number of stacks, let $A=k,k+1,\ldots,n$ , and consider the game $\textsc{SN}{\left(n,A\right)}$ . For a position ${\mathbf p}$ , let … and let $o$ be the number of sta…
Conjectureopencombinatorial-games nim p-positionsarXiv posted 2 days ago

The conjecture on P-positions for Slow SetNim with at least kkk playable stacks