A generalization of the game called Nim.

DOI10.2307/1967321MaRDI QIDQ1486111zbMATH OpenOpenAlexFDO

Authors E. H. Moore

Publication date 1910

Published in Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1967321

Review text

\textit{Bouton} hat in Annals of Math. (3) 11, 35-39 (F. d. M. 32, 225, 1901, JFM 32.0225.02) die Theorie des Nim-Spiels gegeben. Der Verf. der gegenwärtigen Note verallgemeinert die Spielbedingungen dahin, daß zu Anfang des Spieles die gegebenen Elemente auf \(n\) Haufen verteilt werden (statt auf drei), und daß jeder Spieler berechtigt ist, aus \(k(<n)\) Haufen so viel Elemente zu nehmen, wie ihm beliebt (statt \(k=1\) im ursprünglichen Spiel). Er nennt das Spiel \(\text{Nim}_k\) und entwickelt die Theorie.

Cited in

(8)

• Screw discrete dynamical systems and their applications to exact slow NIM
• Variations of the Nim game played on a cube
• On remoteness functions of exact slow k-NIM with k+1 piles
• On remoteness functions of k-NIM with k + 1 piles in normal and in Misère versions
• Computing remoteness functions of Moore, Wythoff, and Euclid's games
• Impartial games with decreasing Sprague-Grundy function and their hypergraph compound
• Emperor nim and emperor sum: a new sum of impartial games
• On the \(\mathcal{P}\)-positions of some infinite families of \textsc{Slow} \(A\)-\textsc{Nim}

This page was built for publication: A generalization of the game called Nim.

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