チョコレートゲームは、Nim(石取りゲーム)の一般化として知られるゲームです。端が苦い板チョコを2人のプレイヤーが交互に縦横に割って食べていき、最後に苦い部分を食べさせられた方の負けというゲームです。このゲームには様々な変種が知られており、パス付きNimをはじめ、他の組合せゲームとの間に興味深い対応関係が知られています。2023年には、プレイヤーごとに食べられる部分が異なるチョコレートゲームについて局面の性質に興味深い法則を発見し、International Journal of Game Theory(Springer)にて成果が掲載されました。
Studies
2023-
Restricted Nim and Josephus Problem
Restricted Nim is a variation of the classic Nim in which the number of stones that can be removed in a single move is limited. A well-known example is the single-pile case where up to half of the stones may be taken at once. On the other hand, the Josephus problem concerns eliminating numbers arranged in a circle by skipping a fixed number each time, with the question of which number will remain at the end. The origin of this problem is traditionally traced back to an episode from the ancient conflict between Rome and Judea.
In this research, we discovered a beautiful correspondence between restricted Nim and the Josephus problem and proved the formula describing this relationship. Furthermore, using this theorem, we developed an algorithm that solves the Josephus problem efficiently. It has been recognized by Prof. Donald Knuth as a highly interesting result.
2022-
Nim with a Pass
Nim with a pass is a well known variation of the classic game of Nim. In Nim, two players alternately choose a heap from several piles of stones and remove some of the stones. A winning strategy for this game was discovered about a century ago. However, when we introduce single pass move which can be used only once by either player during a game, the analysis becomes more complex and no explicit formula has yet been found for the previous player's positions.
In our research, we show that by introducing a simple restriction on this game, it is possible to derive formulas for the previous player’s positions in close games.
2022-
Symbolic Regression Library for Mathematical Research
This symbolic regression library is a data analysis tool designed to identify functions that represent given discrete data as precisely as possible. It was developed not for approximate fitting, but for the complete analysis of complex data patterns that are often difficult for humans to discern. The library has been applied to data analysis in discrete mathematics, including Combinatorial Game Theory, and has contributed to the discovery of several new theorems.
2021-
Chocolate Games
The chocolate game is known as a generalization of Nim. In this game, a chocolate bar with a bitter corner is alternately broken vertically or horizontally by two players, and the player who is forced to eat the bitter piece loses. Various variations of this game have been studied, and interesting correspondences have been observed with other combinatorial games, including Nim with a pass. In 2023, we discovered intriguing structural properties in a partisan version of the chocolate game, where the edible parts differ between players. The results were published in the International Journal of Game Theory (Springer).