Conway's Game of Life
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.
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, alive or dead, (or populated and unpopulated, respectively). 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:
 Any live cell with fewer than two live neighbours dies, as if by underpopulation.
 Any live cell with two or three live neighbours lives on to the next generation.
 Any live cell with more than three live neighbours dies, as if by overpopulation.
 Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
These rules, which compare the behavior of the automaton to real life, can be condensed into the following:
 Any live cell with two or three neighbors survives.
 Any dead cell with three live neighbors becomes a live cell.
 All other live cells die in the next generation. Similarly, all other dead cells stay dead.
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. Each generation is a pure function of the preceding one. The rules continue to be applied repeatedly to create further generations.
Origins
In late 1940, John von Neumann defined life as a creation (as a being or organism) which can reproduce itself and simulate a Turing machine. Von Neumann was thinking about an engineering solution which would use electromagnetic components floating randomly in liquid or gas.[2] This turned out not to be realistic with the technology available at the time. Stanislaw Ulam invented cellular automata, which were intended to simulate von Neumann's theoretical electromagnetic constructions. Ulam discussed using computers to simulate his cellular automata in a twodimensional lattice in several papers. In parallel, Von Neumann attempted to construct Ulam's cellular automaton. Although successful, he was busy with other projects and left some details unfinished. His construction was complicated because it tried to simulate his own engineering design. Over time, simpler life constructions were provided by other researchers, and published in papers and books.
Motivated by questions in mathematical logic and in part by work on simulation games by Ulam, among others, John Conway began doing experiments in 1968 with a variety of different 2D cellular automaton rules.[3] Conway's initial goal was to define an interesting and unpredictable cell automaton. Thus, he wanted some configurations to last for a long time before dying, other configurations to go on forever without allowing cycles, etc. It was a significant challenge and an open problem for years before experts on cell automatons managed to prove that, indeed, Conway's Game of Life admitted of a configuration which was alive in the sense of satisfying Von Neumann's two general requirements. While the definitions before Conway's Life were prooforiented, Conway's construction aimed at simplicity without a priori providing proof the automaton was alive.
Conway chose his rules carefully, after considerable experimentation, to meet these criteria:
 There should be no explosive growth.
 There should exist small initial patterns with chaotic, unpredictable outcomes.
 There should be potential for von Neumann universal constructors.
 The rules should be as simple as possible, whilst adhering to the above constraints.[4]
The game made its first public appearance in the October 1970 issue of Scientific American, in Martin Gardner's "Mathematical Games" column. Theoretically, Conway's Life has the power of a universal Turing machine: anything that can be computed algorithmically can be computed within Life.[5][6][7] Gardner wrote, "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)."[8]
Since its publication, Conway's Game of Life has attracted much interest, because of the surprising ways in which the patterns can evolve. Life provides an example of emergence and selforganization. Scholars in various fields, such as computer science, physics, biology, biochemistry, economics, mathematics, philosophy, and generative sciences have made use of the way that complex patterns can emerge from the implementation of the game's simple rules. The game can also serve as a didactic analogy, used to convey the somewhat counterintuitive notion that design and organization can spontaneously emerge in the absence of a designer. For example, cognitive scientist Daniel Dennett has used the analogy of Conway's Life "universe" extensively to illustrate the possible evolution of complex philosophical constructs, such as consciousness and free will, from the relatively simple set of deterministic physical laws, which might govern our universe.[9][10][11]
The popularity of Conway's Game of Life was helped by its coming into being just in time for a new generation of inexpensive computer access which was being released into the market. The game could be run for hours on these machines, which would otherwise have remained unused at night. In this respect, it foreshadowed the later popularity of computergenerated fractals. For many, Life was simply a programming challenge: a fun way to use otherwise wasted CPU cycles. For some, however, Life had more philosophical connotations. It developed a cult following through the 1970s and beyond; current developments have gone so far as to create theoretic emulations of computer systems within the confines of a Life board.[12][13]
Examples of patterns
Many different types of patterns occur in the Game of Life, which are classified according to their behaviour. Common pattern types include: still lifes, which do not change from one generation to the next; oscillators, which return to their initial state after a finite number of generations; and spaceships, which translate themselves across the grid.
The earliest interesting patterns in the Game of Life were discovered without the use of computers. The simplest still lifes and oscillators were discovered while tracking the fates of various small starting configurations using graph paper, blackboards, and physical game boards, such as those used in Go. During this early research, Conway discovered that the Rpentomino failed to stabilize in a small number of generations. In fact, it takes 1103 generations to stabilize, by which time it has a population of 116 and has generated six escaping gliders;[14] these were the first spaceships ever discovered.[15]
Frequently occurring[16][17] examples (in that they emerge frequently from a random starting configuration of cells) of the three aforementioned pattern types are shown below, with live cells shown in black and dead cells in white. Period refers to the number of ticks a pattern must iterate through before returning to its initial configuration.



The pulsar[18] is the most common period 3 oscillator. The great majority of naturally occurring oscillators are period 2, like the blinker and the toad, but oscillators of many periods are known to exist,[19] and oscillators of periods 4, 8, 14, 15, 30 and a few others have been seen to arise from random initial conditions.[20] Patterns which evolve for long periods before stabilizing are called Methuselahs, the firstdiscovered of which was the Rpentomino. Diehard is a pattern that eventually disappears, rather than stabilizing, after 130 generations, which is conjectured to be maximal for patterns with seven or fewer cells.[21] Acorn takes 5206 generations to generate 633 cells, including 13 escaped gliders.[22]
Conway originally conjectured that no pattern can grow indefinitely—i.e., that for any initial configuration with a finite number of living cells, the population cannot grow beyond some finite upper limit. In the game's original appearance in "Mathematical Games", Conway offered a prize of fifty dollars to the first person who could prove or disprove the conjecture before the end of 1970. The prize was won in November by a team from the Massachusetts Institute of Technology, led by Bill Gosper; the "Gosper glider gun" produces its first glider on the 15th generation, and another glider every 30th generation from then on. For many years, this glider gun was the smallest one known.[23] In 2015, a gun called the "Simkin glider gun", which releases a glider every 120th generation, was discovered that has fewer live cells but which is spread out across a larger bounding box at its extremities.[24]
Smaller patterns were later found that also exhibit infinite growth. All three of the patterns shown below grow indefinitely. The first two create a single blocklaying switch engine: a configuration that leaves behind twobytwo still life blocks as its translates itself across the game's universe.[25] The third configuration creates two such patterns. The first has only ten live cells, which has been proven to be minimal.[26] The second fits in a fivebyfive square, and the third is only one cell high.
Later discoveries included other guns, which are stationary, and which produce gliders or other spaceships; puffer trains, which move along leaving behind a trail of debris; and rakes, which move and emit spaceships.[27] Gosper also constructed the first pattern with an asymptotically optimal quadratic growth rate, called a breeder or lobster, which worked by leaving behind a trail of guns.
It is possible for gliders to interact with other objects in interesting ways. For example, if two gliders are shot at a block in a specific position, the block will move closer to the source of the gliders. If three gliders are shot in just the right way, the block will move farther away. This sliding block memory can be used to simulate a counter. It is possible to construct logic gates such as AND, OR and NOT using gliders. It is possible to build a pattern that acts like a finitestate machine connected to two counters. This has the same computational power as a universal Turing machine, so the Game of Life is theoretically as powerful as any computer with unlimited memory and no time constraints; it is Turing complete.[5][6] In fact, several different programmable computer architectures[28][29] have been implemented in Conway's Life, including a pattern that simulates Tetris.[30]
Furthermore, a pattern can contain a collection of guns that fire gliders in such a way as to construct new objects, including copies of the original pattern. A universal constructor can be built which contains a Turing complete computer, and which can build many types of complex objects, including more copies of itself.[6]
On March 6, 2018, the first truly elementary knightship, Sir Robin, was discovered by Adam P. Goucher.[31] A knightship is a spaceship that moves two squares left for every one square it moves down, (like a knight in chess) as opposed to normal spaceships which move side to side, or a glider which moves exactly diagonally. This is the first new spaceship movement pattern for an elementary spaceship found in fortyeight years. "Elementary" means that it cannot be decomposed into smaller interacting patterns such as gliders and still lifes.[32]
Undecidability
Many patterns in the Game of Life eventually become a combination of still lifes, oscillators, and spaceships; other patterns may be called chaotic. A pattern may stay chaotic for a very long time until it eventually settles to such a combination.
Life is undecidable, which means that given an initial pattern and a later pattern, no algorithm exists that can tell whether the later pattern is ever going to appear. This is a corollary of the halting problem: the problem of determining whether a given program will finish running or continue to run forever from an initial input.[33]
Indeed, since Life includes a pattern that is equivalent to a universal Turing machine (UTM), this deciding algorithm, if it existed, could be used to solve the halting problem by taking the initial pattern as the one corresponding to a UTM plus an input, and the later pattern as the one corresponding to a halting state of the UTM. It also follows that some patterns exist that remain chaotic forever. If this were not the case, one could progress the game sequentially until a nonchaotic pattern emerged, then compute whether a later pattern was going to appear.
Selfreplication
On May 18, 2010, Andrew J. Wade announced a selfconstructing pattern, dubbed "Gemini", that creates a copy of itself while destroying its parent.[34][35] This pattern replicates in 34 million generations, and uses an instruction tape made of gliders oscillating between two stable configurations made of ChapmanGreene construction arms. These, in turn, create new copies of the pattern, and destroy the previous copy. Gemini is also a spaceship, and is the first spaceship constructed in the Game of Life that is an oblique spaceship, which is a spaceship that is neither orthogonal nor purely diagonal.[36][37] In December 2015, diagonal versions of the Gemini were built.[38]
On November 23, 2013, Dave Greene built the first replicator in Conway's Game of Life that creates a complete copy of itself, including the instruction tape.[39]
In October 2018, Adam P. Goucher finished his construction of the 0E0P metacell, a metacell capable of selfreplication. This differed from previous metacells, such as the OTCA metapixel by Brice Due, which only worked with already constructed copies near them. The 0E0P metacell works by using construction arms to create copies that simulate the programmed rule.[40] The actual simulation of Conway's Life or other Moore neighborhood rules is done by simulating an equivalent rule using the von Neumann neighborhood with more states.[41] The name 0E0P is short for "Zero Encoded by Zero Population", which indicates that instead of a metacell being in an "off" state simulating empty space, the 0E0P metacell removes itself when the cell enters that state, leaving a blank space.[42]
Iteration
From most random initial patterns of living cells on the grid, observers will find the population constantly changing as the generations tick by. The patterns that emerge from the simple rules may be considered a form of mathematical beauty. Small isolated sub patterns with no initial symmetry tend to become symmetrical. Once this happens, the symmetry may increase in richness, but it cannot be lost unless a nearby sub pattern comes close enough to disturb it. In a very few cases the society eventually dies out, with all living cells vanishing, though this may not happen for a great many generations. Most initial patterns eventually burn out, producing either stable figures or patterns that oscillate forever between two or more states;[43][44] many also produce one or more gliders or spaceships that travel indefinitely away from the initial location. Because of the nearestneighbour based rules, no information can travel through the grid at a greater rate than one cell per unit time, so this velocity is said to be the cellular automaton speed of light and denoted c.
Algorithms
Early patterns with unknown futures, such as the Rpentomino, led computer programmers across the world to write programs to track the evolution of Life patterns. Most of the early algorithms were similar: they represented Life patterns as twodimensional arrays in computer memory. Typically two arrays are used: one to hold the current generation, and one to calculate its successor. Often 0 and 1 represent dead and live cells respectively. A nested for loop considers each element of the current array in turn, counting the live neighbours of each cell to decide whether the corresponding element of the successor array should be 0 or 1. The successor array is displayed. For the next iteration, the arrays swap roles so that the successor array in the last iteration becomes the current array in the next iteration.
A variety of minor enhancements to this basic scheme are possible, and there are many ways to save unnecessary computation. A cell that did not change at the last time step, and none of whose neighbours changed, is guaranteed not to change at the current time step as well. So, a program that keeps track of which areas are active can save time by not updating inactive zones.[45]
To avoid decisions and branches in the counting loop, the rules can be rearranged from an egocentric approach of the inner field regarding its neighbours to a scientific observer's viewpoint: if the sum of all nine fields in a given neighbourhood is three, the inner field state for the next generation will be life; if the allfield sum is four, the inner field retains its current state; and every other sum sets the inner field to death.
If it is desired to save memory, the storage can be reduced to one array plus two line buffers. One line buffer is used to calculate the successor state for a line, then the second line buffer is used to calculate the successor state for the next line. The first buffer is then written to its line and freed to hold the successor state for the third line. If a toroidal array is used, a third buffer is needed so that the original state of the first line in the array can be saved until the last line is computed.
In principle, the Life field is infinite, but computers have finite memory. This leads to problems when the active area encroaches on the border of the array. Programmers have used several strategies to address these problems. The simplest strategy is simply to assume that every cell outside the array is dead. This is easy to program but leads to inaccurate results when the active area crosses the boundary. A more sophisticated trick is to consider the left and right edges of the field to be stitched together, and the top and bottom edges also, yielding a toroidal array. The result is that active areas that move across a field edge reappear at the opposite edge. Inaccuracy can still result if the pattern grows too large, but there are no pathological edge effects. Techniques of dynamic storage allocation may also be used, creating everlarger arrays to hold growing patterns. Life on a finite field is sometimes explicitly studied; some implementations, such as Golly, support a choice of the standard infinite field, a field infinite only in one dimension or a finite field, with a choice of topologies such as a cylinder, a torus or a Möbius strip.
Alternatively, the programmer may abandon the notion of representing the Life field with a 2dimensional array, and use a different data structure, such as a vector of coordinate pairs representing live cells. This approach allows the pattern to move about the field unhindered, as long as the population does not exceed the size of the livecoordinate array. The drawback is that counting live neighbours becomes a hashtable lookup or search operation, slowing down simulation speed. With more sophisticated data structures this problem can also be largely solved.
For exploring large patterns at great time depths, sophisticated algorithms such as Hashlife may be useful. There is also a method, applicable to other cellular automata too, for implementation of the Game of Life using arbitrary asynchronous updates whilst still exactly emulating the behaviour of the synchronous game.[46] Source code examples that implement the basic Game of Life scenario in various programming languages, including C, C++, Java and Python can be found at Rosetta Code.[47]
Variations
Since Life's inception, new, similar cellular automata have been developed. The standard Game of Life is symbolized as B3/S23. A cell is Born if it has exactly three neighbours, Survives if it has two or three living neighbours, and dies otherwise. The first number, or list of numbers, is what is required for a dead cell to be born. The second set is the requirement for a live cell to survive to the next generation. Hence B6/S16 means "a cell is born if there are six neighbours, and lives on if there are either one or six neighbours". Cellular automata on a twodimensional grid that can be described in this way are known as Lifelike cellular automata. Another common Lifelike automaton, Highlife, is described by the rule B36/S23, because having six neighbours, in addition to the original game's B3/S23 rule, causes a birth. HighLife is best known for its frequently occurring replicators.[48][49]
Additional Lifelike cellular automata exist. The vast majority of these 2^{18} different rules[50] produce universes that are either too chaotic or too desolate to be of interest, but a large subset do display interesting behavior. A further generalization produces the isotropic rulespace, with 2^{102} possible CA rules[51] (Conway's Life again being one of them). These are rules that use the same square grid as the Lifelike rules and the same eightcell neighbourhood, and are likewise invariant under rotation and reflection. However, in isotropic rules, the positions of neighbour cells relative to each other may be taken into account in determining a cell's future state—not just the total number of those neighbours.
Some variations on Life modify the geometry of the universe as well as the rule. The above variations can be thought of as 2D square, because the world is twodimensional and laid out in a square grid. Onedimensional square variations, known as elementary cellular automata,[52] and 3D square variations have been developed, as have 2D hexagonal and 2D triangular variations. A variant using nonperiodic tile grids has also been made.[53]
Conway's rules may also be generalized such that instead of two states, live and dead, there are three or more. State transitions are then determined either by a weighting system or by a table specifying separate transition rules for each state; for example, Mirek's Cellebration's multicoloured Rules Table and Weighted Life rule families each include sample rules equivalent to Conway's Life.
Patterns relating to fractals and fractal systems may also be observed in certain Lifelike variations. For example, the automaton B1/S12 generates four very close approximations to the Sierpinski triangle when applied to a single live cell. The Sierpinski triangle can also be observed in Conway's Game of Life by examining the longterm growth of a long singlecellthick line of live cells,[54] as well as in Highlife, Seeds (B2/S), and Wolfram's Rule 90.[55]
Immigration is a variation that is very similar to Conway's Game of Life, except that there are two on states, often expressed as two different colours. Whenever a new cell is born, it takes on the on state that is the majority in the three cells that gave it birth. This feature can be used to examine interactions between spaceships and other objects within the game.[56] Another similar variation, called QuadLife, involves four different on states. When a new cell is born from three different on neighbours, it takes on the fourth value, and otherwise, like Immigration, it takes the majority value.[57] Except for the variation among on cells, both of these variations act identically to Life.
Music
Various musical composition techniques use Conway's Life, especially in MIDI sequencing.[58] A variety of programs exist for creating sound from patterns generated in Life.[59][60][61]
Notable programs
Computers have been used to follow Life configurations since it was first publicized. When John Conway was first investigating how various starting configurations developed, he tracked them by hand using a Go board with its black and white stones. This was tedious and prone to errors. While Conway was investigating the Rpentomino, John Francis, an undergraduate student at The University of Cambridge, wrote a program (for an IBM 360 at the nearby Institute of Theoretical Astronomy) to check Conway's results. This program showed that the configuration had not reached a stable state after 1000 generations.
The first interactive Life program was written in an early version of ALGOL 68C for the PDP7 by M. J. T. Guy and S. R. Bourne. The results were published in the October 1970 issue of Scientific American, along with the statement: "Without its help, some discoveries about the game would have been difficult to make."[62]
Two early implementations of Life on home computers were by Malcolm Banthorpe written in BBC BASIC. The first was in the January 1984 issue of Acorn User magazine and Banthorpe followed this with a 3D version in the May 1984 issue (these can be downloaded as PDFs).[63] Susan Stepney, Professor of Computer Science at the University of York, followed this up in 1988 with "Life on the line", a program that generated onedimensional cellular automata.[64]
There are now thousands of Life programs online, so a full list will not be provided here. The following is a small selection of programs with some special claim to notability, such as popularity or unusual features. Most of these programs incorporate a graphical user interface for pattern editing and simulation, the capability for simulating multiple rules including Life, and a large library of interesting patterns in Life and other CA rules.
 Golly is a crossplatform (Windows, Macintosh, Linux and also iOS and Android) opensource simulation system for Life and other cellular automata (including all Lifelike cellular automata, the Generations family of cellular automata from Mirek's Cellebration, John von Neumann's 29state cellular automaton, and others), by Andrew Trevorrow and Tomas Rokicki. It includes the Hashlife algorithm for extremely fast generation, and Lua or Python scriptability for both editing and simulation.
 Mirek's Cellebration is a freeware 1D and 2D cellular automata viewer, explorer and editor for Windows. It includes powerful facilities for simulating and viewing a wide variety of CA rules including Life, and a scriptable editor.
 Xlife is a cellularautomaton laboratory by Jon Bennett. The standard UNIX X11 Life simulation application for a long time, it has also been ported to Windows. It can handle cellular automaton rules with the same neighbourhood as Life, and up to eight possible states per cell.[65]
Google implemented an easter egg of Conway's Game of Life in 2012. Users who search for the term are shown an implementation of the game in the search results page.
See also
 Aliquot sequence, a similar problem of nonnegative integers
 Artificial life – A field of study wherein researchers examine systems related to natural life, its processes, and its evolution, through the use of simulations
 Glory Season – 1993 science fiction novel by David Brin, is set in a future society where the Game of Life is played in a competitive 2player mode
 Langton's ant – Twodimensional Turing machine with emergent behavior
 Poietic Generator – A social network game played on a twodimensional matrix, a "human" game of life.
 Reaction–diffusion system – Type of mathematical model that provides diffusingchemicalreagent simulations (including gameoflifelike).
References
 Gardner, Martin (October 1970). "Mathematical Games – The fantastic combinations of John Conway's new solitaire game "life"". Scientific American. 223 (4): 120–123. doi:10.1038/scientificamerican1070120. ISBN 9780894540011. Retrieved 20110626.
 Wolfram, Stephen (2002). A New Kind of Science. Wolfram Media, Inc. p. 1179. ISBN 9781579550080.
 Wolfram, Stephen (2002). A New Kind of Science. Wolfram Media, Inc. p. 877. ISBN 9781579550080.
 Conway, private communication to the 'Life list', 14 April 1999.
 It is a model and simulation that is interesting to watch and can show that simple things can become complicated problems.Paul Chapman (11 November 2002). "Life Universal Computer". Retrieved 12 July 2009.
 Berlekamp, E. R.; Conway, John Horton; Guy, R. K. (2001–2004). Winning Ways for your Mathematical Plays (2nd ed.). A K Peters Ltd.
 Wolfram, Stephen (2002). A New Kind of Science. Wolfram Media, Inc. p. 877. ISBN 9781579550080.
 Gardner, Martin (October 1970). "Mathematical Games  The Fantastic Combinations of John Conway's New Solitaire Game 'Life'" (PDF). Scientific American (223): 120–123.
 Dennett, D. C. (1991). Consciousness Explained. Boston: Back Bay Books. ISBN 9780316180665.
 Dennett, D. C. (1995). Darwin's Dangerous Idea: Evolution and the Meanings of Life. New York: Simon & Schuster. ISBN 9780684824710.
 Dennett, D. C. (2003). Freedom Evolves. New York: Penguin Books. ISBN 9780142003848.
 Paul Rendell (January 12, 2005). "A Turing Machine in Conway's Game of Life". Retrieved July 12, 2009.
 Adam P. Goucher. "Spartan universal computerconstructor". LifeWiki. Retrieved July 12, 2009.
 "Rpentomino". LifeWiki. Retrieved July 12, 2009.
 Stephen A. Silver. "Glider". The Life Lexicon. Retrieved March 4, 2019.
 "Census Results in Conway's Game of Life". The Online LifeLike CA Soup Search. Archived from the original on 20090910. Retrieved July 12, 2009.
 "Spontaneous appeared Spaceships out of Random Dust". Achim Flammenkamp (19951209). Retrieved July 10, 2012.
 Stephen A. Silver. "Pulsar". The Life Lexicon. Retrieved March 4, 2019.
 Game of Life Status page, Jason Summers, retrieved 20120223.
 Achim Flammenkamp (20040907). "Most seen natural occurring ash objects in Game of Life". Retrieved 20080916.
 Stephen A. Silver. "Diehard". The Life Lexicon. Retrieved March 4, 2019.
 Koenig, H. (February 21, 2005). "New Methuselah Records". Retrieved January 24, 2009.
 Stephen A. Silver. "Gosper glider gun". The Life Lexicon. Retrieved March 4, 2019.
 The Hunting of the New Herschel Conduits, ConwayLife forums, April 28th, 2015, posts by Michael Simkin ("simsim314") and Dongook Lee ("Scorbie").
 "Blocklaying switch engine". LifeWiki. Retrieved July 12, 2009.
 Stephen A. Silver. "Infinite Growth". The Life Lexicon. Retrieved March 4, 2019.
 Stephen A. Silver. "Rake". The Life Lexicon. Retrieved March 4, 2019.
 "Programmable computer". conwaylife.com forums. Retrieved August 23, 2018.
 "A Turing Machine in Conway's Game of Life, extendable to a Universal Turing Machine". Paul Rendell. Retrieved August 23, 2018.
 "Build a working game of Tetris in Conway's Game of Life". StackExchange. Retrieved August 23, 2018.
 "Elementary knightship". Retrieved 9 March 2018.
 "Elementary", LifeWiki, retrieved 20181121
 Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy, Winning Ways for your Mathematical Plays. Academic Press, 1982
 "Universal Constructor Based Spaceship". Conwaylife.com. Retrieved 20120624.
 "Gemini – LifeWiki". Conwaylife.com. Retrieved 20120624.
 Aron, Jacob (16 June 2010). "First replicating creature spawned in life simulator". New Scientist. Retrieved 12 October 2013.
 "Gemini – LifeWiki". Conwaylife.com. Retrieved 20131016.
 "Demonoid". LifeWiki. Retrieved 18 June 2016.
 "Geminoid Challenge". Conwaylife.com. Retrieved 20150625.
 PasseScience (20190529), Automate Cellulaire  Passescience #27, retrieved 20190625
 apgoucher (20181112). "Fully selfdirected replication". Complex Projective 4Space. Retrieved 20190625.
 "0E0P metacell  LifeWiki". www.conwaylife.com. Retrieved 20190624.
 Andrzej Okrasinski. "Game of Life Object Statistics". Archived from the original on 20090727. Retrieved July 12, 2009.
 Nathaniel Johnston. "The Online LifeLike CA Soup Search". Archived from the original on 20090910. Retrieved July 12, 2009.
 Alan Hensel. "About my Conway's Game of Life Applet". Retrieved July 12, 2009.
 Nehaniv, Chrystopher L. (15–18 July 2002). SelfReproduction in Asynchronous Cellular Automata. 2002 NASA/DoD Conference on Evolvable Hardware. Alexandria, Virginia, USA: IEEE Computer Society Press. pp. 201–209. doi:10.1109/EH.2002.1029886. ISBN 0769517188. Archived from the original on April 3, 2015. Retrieved 17 March 2015.
 "Conway's Game of Life".
 HighLife – An Interesting Variant of Life by David Bell (.zip file)
 Stephen A. Silver. "Replicator". The Life Lexicon. Retrieved March 4, 2019.
 "Lifelike cellular automata  LifeWiki". Conwaylife.com. Retrieved March 4, 2019.
 "Isotropic  LifeWiki". Conwaylife.com. Retrieved March 4, 2019.
 "Elementary Cellular Automaton". Wolfram Mathworld. Retrieved July 12, 2009.
 "First gliders navigate everchanging Penrose universe". New Scientist.
 "One cell thick pattern". LifeWiki. Retrieved July 12, 2009.
 "Life Imitates Sierpinski". ConwayLife.com forums. Retrieved July 12, 2009.
 Stephen A. Silver. "Immigration". The Life Lexicon. Retrieved March 4, 2019.
 Stephen A. Silver. "QuadLife". The Life Lexicon. Retrieved March 4, 2019.
 Burraston, Dave; Edmonds, Ernest; Livingstone, Dan; Miranda, Eduardo Reck (2004). "Cellular Automata in MIDI based Computer Music". Proceedings of the 2004 International Computer Music Conference. CiteSeerX 10.1.1.6.3882. hdl:10453/1425.
 "glitchDS – Cellular Automaton Sequencer For The Nintendo DS". Synthtopia.com. 20080529. Retrieved 20120624.
 "Game Of Life Music Sequencer". Synthtopia.com. 20090429. Retrieved 20120624.
 "Game Of Life Music Sequencer For iOS, Runxt Life". Synthtopia.com. 20110112. Retrieved 20120624.
 Gardner, Martin (October 1970). "Mathematical Games: The fantastic combinations of John Conway's new solitaire game "Life"". Scientific American. 223 (4): 120–123. doi:10.1038/scientificamerican1070120.
 "Acorn User Magazine Scans". The BBC and Master Computer Public Domain Library. Retrieved 20181229.
 Stepney, Susan. "AcornUser articles". wwwusers.cs.york.ac.uk. AcornUser. Retrieved 20181229.
 "Xlife".
External links
Wikimedia Commons has media related to Game of Life. 
 Conway's Game of Life at Curlie
 Life Lexicon, extensive lexicon with many patterns
 Game of Life News
 LifeWiki
 Conway Life forums
 Catagolue, an online database of objects in Conway's Game of Life and similar cellular automata
 Cellular Automata FAQ – Conway's Game of Life