
related topics 
{math, number, function} 
{system, computer, user} 
{specie, animal, plant} 
{game, team, player} 
{ship, engine, design} 
{math, energy, light} 
{theory, work, human} 
{son, year, death} 
{@card@, make, design} 
{country, population, people} 
{disease, patient, cell} 
{work, book, publish} 
{acid, form, water} 

The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.^{[1]}
The "game" is a zeroplayer game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.
Contents
Rules
The universe of the Game of Life is an infinite twodimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:
The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seedâ€”births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick (in other words, each generation is a pure function of the preceding one). The rules continue to be applied repeatedly to create further generations.
Origins
Conway was interested in a problem presented in the 1940s by renowned mathematician John von Neumann, who tried to find a hypothetical machine that could build copies of itself, and succeeded when he found a mathematical model for such a machine with very complicated rules on a rectangular grid. The Game of Life emerged as Conway's successful attempt to simplify von Neumann's ideas. The game made its first public appearance in the October 1970 issue of Scientific American, in Martin Gardner's "Mathematical Games" column. From a theoretical point of view, it is interesting because it has the power of a universal Turing machine: that is, anything that can be computed algorithmically can be computed within Conway's Game of Life.^{[2]}^{[3]} Gardner wrote:
The game made Conway instantly famous, but it also opened up a whole new field of mathematical research, the field of cellular automata ... Because of Life's analogies with the rise, fall and alterations of a society of living organisms, it belongs to a growing class of what are called 'simulation games' (games that resemble real life processes)
Full article ▸


related documents 
Java Database Connectivity 
Prototypebased programming 
Macro (computer science) 
Comparison of Java and C++ 
Vi 
Convolutional code 
Bzip2 
Interpreter (computing) 
Bresenham's line algorithm 
Linear 
Infinite loop 
Object database 
List of computing topics 
NaN 
Mersenne twister 
Controllability 
Golomb coding 
Hilbert's second problem 
Kruskal's algorithm 
Euler's totient function 
Local ring 
Constant of integration 
Exact sequence 
Goodstein's theorem 
Probability space 
Diophantine set 
Laurent series 
Kolmogorov space 
Banach fixed point theorem 
Conjunctive normal form 
