Methuselah (cellular automaton)
From Wikipedia the free encyclopedia
In cellular automata, a methuselah is a small "seed" pattern of initial live cells that take a large number of generations in order to stabilize. More specifically, Martin Gardner defines them as patterns of fewer than ten live cells which take longer than 50 generations to stabilize,[1] although some patterns that are larger than ten cells have also been called methuselahs. Patterns must eventually stabilize to be considered methuselahs. The term comes from the Biblical Methuselah, who lived for 969 years.
In Conway's Game of Life[edit]
In Conway's Game of Life, one of the smallest methuselahs is the R-pentomino,[2] a pattern of five cells first considered by Conway himself,[3] that takes 1103 generations before stabilizing with 116 cells. The acorn,[4] a pattern of only seven live cells developed by Charles Corderman, takes 5206 generations to stabilize and produce a 633-cell pattern referred to as its "oak". Some other examples of methuselahs are called bunnies[5] and rabbits.[6]
References[edit]
- ^ Gardner, M. (1983). "The Game of Life, Part III". Wheels, Life and Other Mathematical Amusements. W.H. Freeman. p. 246.
- ^ Silver, Stephen (28 February 2006). "R-pentomino". Life Lexicon. Archived from the original on 21 December 2008. Retrieved 2008-12-24.
- ^ Gardner, M. (1983). "The Game of Life, Part III". Wheels, Life and Other Mathematical Amusements. W.H. Freeman. pp. 219, 223.
- ^ Silver, Stephen (28 February 2006). "Acorn". Life Lexicon. Archived from the original on 19 April 2009. Retrieved 2008-12-24.
- ^ Silver, Stephen (28 February 2006). "Bunnies". Life Lexicon. Archived from the original on 22 April 2009. Retrieved 2008-12-24.
- ^ Silver, Stephen (28 February 2006). "Rabbits". Life Lexicon. Archived from the original on 21 December 2008. Retrieved 2008-12-24.
External links[edit]
- List of longest-lived methuselahs at LifeWiki