In this article the authors are going to present several combinatorial games that are variants of the game of Nim. They are very different from the traditional game of Nim, since the coordinates of positions of the game satisfy inequalities. These games have very interesting mathematical structures. For example, the lists of P-positions of some of these variants are subsets of the list of P-positions of the traditional game of Nim. The authors are sure that they were the first people who treated variants of the game of Nim conditioned by inequalities. Some of these games will produce beautiful 3D graphics (indeed, you will see the Sierpinski gasket when you look from a certain view point). We will also present some new results for the chocolate problem, a problem which was studied in a previous paper and related to Nim. The authors make substantial use of Mathematica in their research of combinatorial games.
Ryohei Miyadera, Kwansei Gakuin, Japan email@example.com
Yamauchi, Toshiyuki; Inoue, Taishi; and Tomari, Yuuki
"Variants of the Game of Nim that have Inequalities as Conditions,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 10
, Article 12.
Available at: http://scholar.rose-hulman.edu/rhumj/vol10/iss2/12