Nim fractals
From MaRDI portal
Publication:2877906
zbMATH Open1295.91023arXiv1405.5942MaRDI QIDQ2877906FDOQ2877906
Authors: Tanya Khovanova, Joshua Xiong 
Publication date: 28 August 2014
Published in: Journal of Integer Sequences (Search for Journal in Brave)
Abstract: We enumerate P-positions in the game of Nim in two different ways. In one series of sequences we enumerate them by the maximum number of counters in a pile. In another series of sequences we enumerate them by the total number of counters. We show that the game of Nim can be viewed as a cellular automaton, where the total number of counters divided by 2 can be considered as a generation in which P-positions are born. We prove that the three-pile Nim sequence enumerated by the total number of counters is a famous toothpick sequence based on the Ulam-Warburton cellular automaton. We introduce 10 new sequences.
Full work available at URL: https://arxiv.org/abs/1405.5942
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (9)
- The Sierpiński sieve of Nim-varieties and binomial coefficients
- Periodicity and other structure in a colorful family of Nim-like arrays
- LIM is not slim
- The game of \(n\)-times nim
- A family of Nim-like arrays: the locator theorem
- P-positions in modular extensions to Nim
- Fractal sequences and restricted Nim.
- Nim-induced dynamical systems over \(\mathbb Z_2\)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Nim fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2877906)
