Corpus ID: 17788465

Nim Fractals

@article{Khovanova2014NimF,
  title={Nim Fractals},
  author={Tanya Khovanova and Joshua Xiong},
  journal={J. Integer Seq.},
  year={2014},
  volume={17},
  pages={14.7.8}
}
  • Tanya Khovanova, Joshua Xiong
  • Published 2014
  • Computer Science, Mathematics
  • J. Integer Seq.
  • 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES
    The Toothpick Sequence and Other Sequences from Cellular Automata
    7
    Winning Ways for Your Mathematical Plays
    1463
    An Introduction to the Theory of Numbers
    2679
    On some mathematical properties connected with patterns of growth of figures
    96
    A New Kind of Science p
    • 1731
    Lessons in Play, A K
    • 2007
    Mathematics and games
    • 1964
    On the cellular automaton of Ulam and Warburton
    • 2003
    The Annals Of Mathematical Statistics Vol-i
    108
    solver), A tree in the integer lattice, Problem 10360
    • 1994