Difference between revisions of "Game of Life"
Jump to navigation
Jump to search
(merge proposal) |
DavidB4-bot (talk | contribs) (→top: Spelling/Grammar Check, typos fixed: neigbors → neighbors (2)) |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
{{merge|Conway's game of life}} | {{merge|Conway's game of life}} | ||
| − | [[Image:Gospers glider gun.gif|right|thumb]] | + | [[Image:Gospers glider gun.gif|right|thumb|Glider Gun]] |
The '''Game of Life''' is a [[cellular automaton]] constructed by mathematician [[John Conway]] and popularized by [[Martin Gardner]]. The game starts with an infinite lattice of [[squares]]. Any cell is either has a [[bacterium]] (or is '''alive''') or does not have a bacterium (is '''dead''') and only a finite number start alive. The 8 surrounding squares of each cell make up its neighbors. At each iteration of the game the states of cells change based on the following rules: | The '''Game of Life''' is a [[cellular automaton]] constructed by mathematician [[John Conway]] and popularized by [[Martin Gardner]]. The game starts with an infinite lattice of [[squares]]. Any cell is either has a [[bacterium]] (or is '''alive''') or does not have a bacterium (is '''dead''') and only a finite number start alive. The 8 surrounding squares of each cell make up its neighbors. At each iteration of the game the states of cells change based on the following rules: | ||
| − | # Any living cell with one or no | + | # Any living cell with one or no neighbors becomes too lonely and dies. |
| − | # Any living cell with four or more | + | # Any living cell with four or more neighbors becomes overcrowded and dies. |
# Any living cell with two or three neighbors stays alive. | # Any living cell with two or three neighbors stays alive. | ||
# Any dead cell that has exactly three neighbors becomes alive. | # Any dead cell that has exactly three neighbors becomes alive. | ||
| Line 12: | Line 12: | ||
The Game of Life is [[Turing complete]] and started off research into [[cellular automata]]. | The Game of Life is [[Turing complete]] and started off research into [[cellular automata]]. | ||
| − | ==External | + | ==External links== |
| − | [http://www.ibiblio.org/lifepatterns/ A Game of Life Simulator] (uses Javascript) | + | * [http://www.ibiblio.org/lifepatterns/ A Game of Life Simulator] (uses Javascript) |
| − | [[ | + | [[Category:Mathematics]] |
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
Latest revision as of 19:28, July 12, 2016
It has been suggested that this article or section be merged with [[::Conway's game of life|Conway's game of life]]. (Discuss)
The Game of Life is a cellular automaton constructed by mathematician John Conway and popularized by Martin Gardner. The game starts with an infinite lattice of squares. Any cell is either has a bacterium (or is alive) or does not have a bacterium (is dead) and only a finite number start alive. The 8 surrounding squares of each cell make up its neighbors. At each iteration of the game the states of cells change based on the following rules:
- Any living cell with one or no neighbors becomes too lonely and dies.
- Any living cell with four or more neighbors becomes overcrowded and dies.
- Any living cell with two or three neighbors stays alive.
- Any dead cell that has exactly three neighbors becomes alive.
Each round (or generation) of the game occurs simultaneously. That is, each of the four rules is applied to each square at the same time.
The Game of Life is Turing complete and started off research into cellular automata.
External links
- A Game of Life Simulator (uses Javascript)