Recursive Patterns in the Chocolate Game

Abstract

We study the recursive structure of P-positions in the chocolate game $C_{m,m}$, an impartial game played on an $m\times m$ chocolate bar. We show that the set of P-positions exhibits self-similar patterns that can be described and enumerated recursively. We further establish a correspondence between these patterns and the cross-sections of a three-dimensional Sierpiński octahedron. Finally, we show that the P-positions can be generated by a second-order cellular automaton, analogous to the onedimensional Rule-60 automaton. Our results reveal deep connections between combinatorial games, fractal geometry, and discrete dynamical systems.

15 pages, 11 figures