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.
In Conway's original formulation (as part of his proof of the existence of a universal computer in Life) two gliders were used to pull the block inwards by three diagonal spaces, as shown below, and thirty gliders were used to push it out by the same amount.
Dean Hickerson later greatly improved on this, finding a way to pull a block inwards by one diagonal space using 2 gliders, and push it out the same distance using 3 gliders. In order for the memory to be of any use there also has to be a way to read the value held. It suffices to be able to check whether the value is zero (as Conway did), or to be able to detect the transition from one to zero (as Hickerson did).
Dean Hickerson's sliding block memory is used in Paul Chapman's URM, and the key salvos from it are used in several other complex constructions, such as David Bell's Collatz 5N+1 simulator and Adam P. Goucher's pi calculator and Spartan universal computer-constructor.
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.
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.
Each cell with three neighbors becomes populated.
Video’s about the Game of Life
Interesting articles about John Conway
Implemented by Edwin Martin <edwin@bitstorm.org>