LIM is not slim

DOI10.1007/S00182-013-0380-ZMaRDI QIDQ2453490zbMATH OpenOpenAlexWikidataFDO

Authors Alex Fink, Aviezri S. Fraenkel, Carlos Santos

Publication date 6 June 2014

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00182-013-0380-z

zbMATH Keywords

cellular automatoncombinatorial game theoryimpartial gamesNimSprague-Grundy theory

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Combinatorial games (91A46)

Review text

J. N. Silva introduced in 2002 the impartial combinatorial game of LIM played on three piles of token. A player takes \(n\) token from two piles but also adds \(n\) token to the third. In this paper, the authors introduce an equivalent rule-set LIM', a sort of coordinates transform, closely related to the classical game of NIM. Hence, a formula describing the \(\mathcal{G}\)-values of LIM is proved. It solves LIM completely. This short paper ends with an enumeration of the P-positions of LIM with \(n\) token and its relationship with Ulam-Warburton cellular automata.

Recommendations

• Nim fractals
• Square, rectangular and triangular Nim games
• Impartial poker nim
• Slow \(K\)-\textsc{Nim}
• 2-pile Nim with a restricted number of move-size imitations

Cited in

(2)

• Amalgamation Nim
• Good properties of combinatorial rulesets: some consequences

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: LIM is not slim

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