Game of Life (cellular automaton) 1.1

Features:

• Variable grid size
• Option to draw a grid at lower resolutions
• Simulation display with zoom functionality
• Set initial generation at random or draw your own initial generation
• Special initial generation: glider gun (can be positioned on simulation display) and ticker (programmable text)
• Option to fade out previous generations
• Option to colorize the age of living cells
• Choose between an infinite and a finite grid
• Set simulation speed between 0x (next generation manual) and 100x and change the value during runtime

"The Game of Life [...] is a cellular automaton devised by the British mathematician John Horton Conway in 1970.

[...]

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. Every cell interacts with its eight neighbors, 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 neighbors dies, as if caused by under-population.
• Any live cell with two or three live neighbors lives on to the next generation.
• Any live cell with more than three live neighbors dies, as if by overcrowding.
• Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.

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 (in other words, each generation is a pure function of the preceding one). The rules continue to be applied repeatedly to create further generations."

Source of description: wikipedia.org