Chocolate Games with a Pass

Abstract: The authors present their research on chocolate games with a pass-move. Chocolate games are generalizations of Nim. In this work, we modify the standard rules of the game to allow a one-time pass; that is, a pass-move may be used at most once in the game, but not from a terminal position. Once the pass has been used by either player, it is no longer available. In the case of the classical three-pile nim with $x,y,z$ for the number of stones of each pile, the previous player wins when the exclusive or'' of $x,y,z$ is $0$, and its Grundy number is calculated asexclusive or'' of $x,y,z$. However, no mathematical formula is known for the previous player's winning position when a pass-move is allowed. In this study, we show a theorem to determine the Grundy number of a position with a pass where the position can be considered as a disjunctive sum of two positions which have a special property. By using the theorem, we show closed formulas for positions which have Grundy numbers $0, 1,$ and $2$ for some chocolate games with a pass.