Zero player game for observing cellular automation & evaluation of their growth. more at
Video : https://youtu.be/UFA1mbvZFmQ
wikipedia : https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life
Numberphile : https://www.youtube.com/watch?v=R9Plq-D1gEk
Conway's game of life using C language & OpenGL
Rules :
The universe of the Game of Life is an infinite, two-dimensional 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 behaviour of the automaton to real life, can be condensed into the following:
- Any live cell with two or three neighbours survives.
- Any dead cell with three live neighbours 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.
Only B&W color used for alpha version.
Player can only simulate the total process without additional information on hand.
All cell can be identified differently.
Random start and automatic simulation added.
