Seeds (cellular automaton)

Seeds (cellular automaton)

Seeds is a cellular automaton in the same family as the Game of Life, initially investigated by Brian Silverman and named by Mirek Wójtowicz. It consists of infinite two-dimensional grid of cells, each of which may be in one of two states: "on" or "off". Each cell is considered to have eight neighbors (Moore neighbourhood), as in Life. In each time step, a cell turns on if it was off but had exactly two neighors that were on; all other cells turn off. Thus, in the notation describing the family of cellular automata containing Life, it is described by the rule M:/2.

In Game of Life terminology, a pattern in which all cells that were on turn off at each step is called a "phoenix". All patterns in Seeds have this form.

Even though all live cells are constantly dying, the small birth requirement of two cells means that nearly every pattern in Seeds explodes into a chaotic mess that grows to cover the entire universe. However, some patterns are known that behave in a more controlled fashion, repeating the same shape either in the same position of the grid (an oscillator) or translated some number of grid units after several steps (a spaceship). More complex rake and puffer patterns are known which move like spaceships leaving trails of oscillators or other spaceships behind them. Most of these patterns move at a speed of one cell per time step (the so-called "speed of light") including three commonly seen spaceships with four on cells each, but slower-moving patterns are also known. A [ collection of patterns for the Seeds rule] collected by Jason Summers includes patterns found by Stephen Wright, Mirek Wójtowicz, Noam Elkies, Mark Niemiec, Peter Naszvadi, and David Eppstein.

External links

*cite web
author = David Eppstein
url =
title = Known spaceships for the Seeds rule

*cite web
author = Alan Hensel
url =
title = A Brief Illustrated Glossary of Terms in Conway's Game of Life

*cite web
author = Brian Silverman
year = 1996
title = Changing the Rules
url =
work = [ The Virtual Computer]

* cite web
author = Mirek Wójtowicz
url =
title = Cellular Automaton Rules Lexicon — Family: Life
work = Mirek's Cellebration

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Rake (cellular automaton) — A rake in a cellular automaton is a puffer that, instead of leaving behind a trail of debris, emits a stream of spaceships. [ [ r.htm#rake Rake, Life lexicon] .… …   Wikipedia

  • Oscillator (cellular automaton) — In a cellular automaton, an oscillator is a pattern that returns to its original state, in the same orientation and position, after a finite number of generations. Thus the evolution of such a pattern repeats itself indefinitely. Depending on… …   Wikipedia

  • Methuselah (cellular automaton) — The die hard Methuselah lives for 130 generations before all cells die. 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… …   Wikipedia

  • Life-like cellular automaton — A cellular automaton (CA) is Life like (in the sense of being similar to Conway s Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally… …   Wikipedia

  • Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] …   Wikipedia

  • Conway's Game of Life — Conway game , which redirects to here, can also refer to games as defined by surreal numbers, which John Conway also developed …   Wikipedia

  • Day & Night — This article is about a cellular automaton rule. For other uses, see Day Night (disambiguation). Gun and antigun demonstrating the symmetric nature of Day Night. Day Night is a cellular automaton rule in the same family as Game of Life. It is… …   Wikipedia

  • Automate cellulaire — À gauche, une règle locale simple : une cellule passe d un état (i) au suivant (i+1) dans le cycle d états dès que i+1 est présent dans au moins 3 cellules voisines. À droite, le résultat (complexe) de l application répétée de cette règle… …   Wikipédia en Français

  • Moore neighborhood — The Moore neighborhood comprises eight cells which surround center C. In cellular automata, the Moore neighborhood comprises the eight cells surrounding a central cell on a two dimensional square lattice. The neighborhood is named after Edward F …   Wikipedia

  • Mirek's Cellebration — Screenshot of Mirek s Cellebration Original author(s) Mirek Wojtowicz …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”