Conway’s Game of Life

....O.........O................... ....OOO.....OOO................... .O.....O...O...................... ..O...OO...OO..................... OOO............................... .........O........................ ........O.O....................... ........O.O....................... .........O........................ ...............................O.. ...............................O.. ....................OO.........OOO ..............OO....OO...........O ........OO...OO................... .......O..O....O.................. ..OO....OO........................ .O.O.............................. .O................................ OO................................ ..........OO...................... ..........O....................... ...........OOO.................... .............O....................

Life Lexicon

This Life lexicon is compiled by Stephen A. Silver from various sources and may be copied, modified and distributed under the terms of the Creative Commons Attribution-ShareAlike 3.0 Unported licence. See the original credit page for all credits and the original download location. (CC BY-SA 3.0)

Callahan G-to-H

A stable glider reflector and glider-to-Herschel converter discovered by Paul Callahan in November 1998. Its recovery time is 575 ticks. The initial stage converts two gliders into a Herschel. A ghost Herschel in the pattern below marks the output location:

Game of Life pattern ’Callahan_G-to-H’

The glider from the southeast can be supplied by an Fx77 + L112 + Fx77 Herschel track, or by reflecting the output Herschel's FNG as in the p8 G-to-H. See also Silver reflector, Silver G-to-H.

Game of Life Explanation

The Game of Life is not your typical computer game. It is a cellular automaton, and was invented by Cambridge mathematician John Conway.

This game became widely known when it was mentioned in an article published by Scientific American in 1970. It consists of a grid of cells which, based on a few mathematical rules, can live, die or multiply. Depending on the initial conditions, the cells form various patterns throughout the course of the game.

Rules

For a space that is populated:
Examples

Each cell with one or no neighbors dies, as if by solitude.

Each cell with four or more neighbors dies, as if by overpopulation.

Each cell with two or three neighbors survives.

For a space that is empty or unpopulated:

Each cell with three neighbors becomes populated.

More information

Video’s about the Game of Life

Stephen Hawkings The Meaning of Life (John Conway's Game of Life segment)
The rules are explained in Stephen Hawkings’ documentary The Meaning of Life
Inventing Game of Life (John Conway) - Numberphile
John Conway himself talks about the Game of Life

Interesting articles about John Conway

Implemented by Edwin Martin <>