Conway’s Game of Life

......O.................. .......O................. .....OOO................. ......................... ......................... ......................... ......................... ......................... ......................... ......................... ................O........ ..............O.O........ ..........OO...OO........ ...........OO............ ..........O..........O.OO .....................OO.O ......................... ......................... ......................... ......................... ......................... .O....................... .OO...................... O.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)

Boat-bit

A binary digit represented by the presence of a boat next to a snake (or other suitable object, such as an aircraft carrier). The bit can be toggled by a glider travelling along a certain path. A correctly timed glider on a crossing path can detect whether the transition was from 1 to 0 (in which case the crossing glider is deleted) or from 0 to 1 (in which case it passes unharmed). Three gliders therefore suffice for a non-destructive read. The mechanisms involved are shown in the diagram below. Here the bit is shown in state 0. It is about to be set to 1 and then switched back to 0 again. The first crossing glider will survive, but the second will be destroyed.

Game of Life pattern ’boat-bit_(1)’

In January 1997 David Bell found a method of reading the bit while setting it to 0. A MWSS is fired at the boat-bit. If it is already 0 (absent) then the MWSS passes unharmed, but if it is 1 (present) then the boat and the MWSS are destroyed and, with the help of an eater1, converted into a glider which travels back along exactly the same path that is used by the gliders that toggle the boat-bit. There are many other equivalent methods based on alternate incoming test signals.

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 <>