Conway's Game Of Life
| Conway's Game of Life |
| Designer: | John Horton Conway |
| Released: | 1970 |
| Modes: | no-player |
| Perspective: | {$perspective} |
| Platforms: | Widely ported |
| PCG Types: | dynamic-systems |
Description
The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is the best-known example of cellular automata.
Rules
The Game of Life operates on the following set of rules:
- Any live cell with fewer than two live neighbours dies, as if by needs caused by underpopulation.
- Any live cell with more than three live neighbours dies, as if by overcrowding.
- Any live cell with two or three live neighbours lives, unchanged, to the next generation.
- Any tile with exactly three live neighbours cells will be populated with a living cell.
Use of Procedural Content Generation Methods
External Links
Conway's Game of Life - Wikipedia entry for Conway's Game of Life.
page revision: 9, last edited: 22 Aug 2010 01:03
