Conway's Game of Life

1940

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.

1968

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 two-dimensional cellular automaton rules.

1970

The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.

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 Game of Life board. ==Examples of patterns== Many different types of patterns occur in the Game of Life, which are classified according to their behaviour.

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 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." Two early implementations of the Game of Life on home computers were by Malcolm Banthorpe written in BBC BASIC.

1984

The first was in the January 1984 issue of Acorn User magazine, and Banthorpe followed this with a three-dimensional version in the May 1984 issue.

1988

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 one-dimensional cellular automata. There are now thousands of Game of Life programs online, so a full list will not be provided here.

2010

If this were not the case, one could progress the game sequentially until a non-chaotic pattern emerged, then compute whether a later pattern was going to appear. ==Self-replication== On May 18, 2010, Andrew J.

2012

It can handle cellular automaton rules with the same neighbourhood as the Game of Life, and up to eight possible states per cell. Google implemented an easter egg of the Game of Life in 2012.

2013

In December 2015, diagonal versions of the Gemini were built. On November 23, 2013, Dave Greene built the first replicator in the Game of Life that creates a complete copy of itself, including the instruction tape. In October 2018, Adam P.

2015

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. Smaller patterns were later found that also exhibit infinite growth.

In December 2015, diagonal versions of the Gemini were built. On November 23, 2013, Dave Greene built the first replicator in the Game of Life that creates a complete copy of itself, including the instruction tape. In October 2018, Adam P.

2018

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. In 2018, the first truly elementary knightship, Sir Robin, was discovered by Adam P.

In December 2015, diagonal versions of the Gemini were built. On November 23, 2013, Dave Greene built the first replicator in the Game of Life that creates a complete copy of itself, including the instruction tape. In October 2018, Adam P.




All text is taken from Wikipedia. Text is available under the Creative Commons Attribution-ShareAlike License .

Page generated on 2021-08-05