Series Details Edit

Game of Life Edit

The Game of Life is a cellular automaton devised by John Conway in 1970. The player defines the initial state of the cells and everything else is computed according to simple rules.

The Rules Edit

  • Any live cell with fewer than two live neighbors dies, as if caused by under-population.
  • Any live cell with two or three live neighbors lives on to the next generation.
  • Any live cell with more than three live neighbors dies, as if by over-population.
  • Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
  • As an additional rule, any new cell gets its color from its three parents as if passing on genes.

The additional Rule Edit

The additional rule extends the common Game of Life rules to add color breeding. A newborns cell gets the color by picking the red, green or blue color component from one random parent each.

Highlife Edit

Some of the patterns are simulated with further extended rules, called Highlife. All the above rules apply and in addition, a cell with six neighbors becomes alive too.

Patterns Edit

The Run Length Encoded file format (RLE) is commonly used for storing large patterns. The Variants description field contains the simulated pattern (as encoded text). Copy it from there and run it in any tool supporting the Game of Life RLE-format.

View this Series on NeonMob

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.