Impartial Triangular Chocolate Bar Games

MaRDI QIDQ6293932zbMATH OpenFDO

Authors Ryohei Miyadera, Shunsuke Nakamura, Masanori Fukui

Publication date 14 November 2017

Abstract: Chocolate bar games are variants of the game of Nim in which the goal is to leave your opponent with the single bitter part of the chocolate bar. The rectangular chocolate bar game is a thinly disguised form of classical multi-heap Nim. In this work, we investigate the mathematical structure of triangular chocolate bar games in which the triangular chocolate bar can be cut in three directions. In the triangular chocolate bar game, a position is a $mathcalP$-position if and only if $xoplusyoplusz=0$, where the numbers $x,y,z$ stand for the maximum number of times that the chocolate bar can be cut in each direction. Moreover, the Grundy number of a position $(x,y,z)$ is not always equal to $xoplusyoplusz$, and a generic formula for Grundy numbers in not known. Therefore, the mathematical structure of triangular chocolate bar game is different from that of classical Nim.

This page was built for publication: Impartial Triangular Chocolate Bar Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6293932)