Alive or Dead: Game of Life 2.0.18

The Game of Life, also known simply as Life, is a cellular automaton created by the British mathematician John Horton Conway in 1970.

This game operates without player input, as its progression is determined by its initial configuration. Players engage in the Game of Life by setting up an initial scenario and observing how it develops. Notably, it is Turing complete, enabling simulations of universal constructors and various Turing machines.

The Game of Life's universe features an infinite, two-dimensional orthogonal grid comprised of square cells, each existing in either an alive or dead state (alternatively described as populated or unpopulated). Interaction takes place between each cell and its eight neighboring cells, situated horizontally, vertically, or diagonally. During each time step, the following transitions unfold:

1. Any live cell with fewer than two live neighbors dies due to underpopulation.
2. Any live cell with two or three live neighbors survives to the next generation.
3. Any live cell with more than three live neighbors perishes due to overpopulation.
4. Any dead cell surrounded by exactly three live neighbors springs to life through reproduction.

These rules, paralleling real-life principles, can be simplified as follows:

1. A live cell with two or three neighbors lives on.
2. A dead cell with exactly three live neighbors becomes alive.
3. All other live cells perish in the upcoming generation while all other dead cells remain inert.

The initial pattern serves as the system's seed. The first generation emerges as a result of applying the aforementioned rules universally to every cell within the seed; births and deaths coincide at a moment referred to as a tick. Each subsequent generation forms solely based on its predecessor. This iterative application of rules leads to the creation of successive generations.