Grundy Numbers of Impartial Chocolate Bar Games

Ryohei Miyadera; Shunsuke Nakamura; Yushi Nakaya

Home/Archive/arXiv

arXiv · 1711.05035

Grundy Numbers of Impartial Chocolate Bar Games

Ryohei Miyadera·Shunsuke Nakamura·Yushi Nakaya

View original source ↗Read source document ↗Export metadata ↓

Abstract

Chocolate bar games are variants of the CHOMP game in which the goal is to leave your opponent with the single bitter part of the chocolate. In this paper, we investigate step chocolate bars whose widths are determined by a fixed function of the horizontal distance from the bitter square. When the width of chocolate bar is proportional to the distance from the bitter square and the constant of proportionality is even, the authors have already proved that the Grundy number of this chocolate bar is $(m-1) \oplus (n-1)$, where $m$ is is the largest width of the chocolate and $n$ is the longest horizontal distance from the bitter part. This result was published in a mathematics journal(Integers,15, 2015). On the other hand, if the constant of proportionality is odd, the Grundy number of this chocolate bar is not $(m-1) \oplus (n-1)$. Therefore, it is natural to look for a necessary and sufficient condition for chocolate bars to have the Grundy number that is equal to $(m-1) \oplus (n-1)$, where $m$ is the largest width of the chocolate and $n$ is the longest horizontal distance from the bitter part. In the first part of the present paper, the authors present this necessary and sufficient condition. Next, we modified the condition that the Grundy number that is equal to $(m-1) \oplus (n-1)$, and we studied a necessary and sufficient condition for chocolate bars to have Grundy number that is equal to $((m-1) \oplus (n-1+s))-s$, where $m$ is is the largest width of the chocolate and $n$ is the longest horizontal distance from the bitter part. We present this necessary and sufficient condition in the second part of this paper.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ryohei Miyadera, Shunsuke Nakamura, Yushi Nakaya. 2017-11-14. Grundy Numbers of Impartial Chocolate Bar Games. https://arxiv.org/abs/1711.05035

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗

arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗

arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗