Author:
Albert Michael H.,Nowakowski Richard J.
Abstract
In the game of End-Nim two players take turns in removing one or more boxes from a string of non-empty stacks. At each move boxes may only be taken from the two stacks which form the ends of the string (unless only one stack remains!). We give a solution for both impartial and partizan versions of the game and explain the significance of the mystic hieroglyphs: $$ \begin{array}{|cc|} \hline \uparrow & \downarrow \\ \downarrow & \uparrow \\ \hline \end{array} $$
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Last Nim Game With Shifted Alliance System;Indian Journal of Pure and Applied Mathematics;2021-08-16
2. One-Pile Nim games with arbitrarily many random players;Discrete Applied Mathematics;2019-02
3. Multi-player End-Nim games;Theoretical Computer Science;2019-02
4. Bounded Greedy Nim;Theoretical Computer Science;2018-10
5. Greedy Nim $$_\mathrm{{k}}$$ k Game;Journal of Combinatorial Optimization;2018-02-22