Conway's Game of Life
From Wikiversity
In this learning project we explore Conway's Game of Life. The game involves an (infinite) two-dimensional grid with black and white squares, which may be represented as 1 and 0. One may think of them as "life cells" or "dead cells". The grid evolves. The evolution rule is as follows:
- All cells evolve simultaneously
- Each cell has eight neighbours
- A life cell with two or three neighbours continue to live; otherwise dies.
- A dead cell with exactly three neighbours will come to life.
The game of Life is a prototypical example of a w:cellular automaton, an automatic machine of cells. It has attracted interests of researchers in diverse fields. Conway's game of Life is a w:universal Turing machine.
For more details and context, see w:Conway's Game of Life.
[edit] Try your hands
You may try your hand on the following (finite!) 10x10 toroidal model of the game of Life by pressing the "edit" button on the sandbox and then the "save page" button below the editing window. (If it doesn't seem to work, there may be a cache problem. Try purging it or editing it again. )
[edit] Sandbox
{{subst:Game of Life
|0|0|0|1|1|0|0|0|0|0
|0|0|0|1|1|1|0|0|0|0
|0|0|1|0|0|1|0|0|0|0
|0|0|0|1|1|0|0|0|0|0
|0|0|0|0|0|0|0|0|0|0
|0|0|0|0|0|0|0|0|0|0
|0|0|0|0|0|0|1|0|1|0
|0|0|0|0|0|0|0|1|1|0
|0|0|0|0|0|0|0|1|0|0
|0|0|0|0|0|0|0|0|0|0
}}
