Conway's Game Of Life
Description:
Conway's Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It's a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input from human players. The game is played on an infinite two-dimensional 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 adjacent to it horizontally, vertically, or diagonally.
Rules:
The game evolves in turns, often referred to as ticks or steps. At each step, the following transitions occur:
1. Birth: A dead cell with exactly three live neighbors becomes a live cell.
2. Death by isolation: A live cell with fewer than two live neighbors dies.
3. Death by overcrowding: A live cell with more than three live neighbors dies.
4. Survival: A live cell with two or three live neighbors continues to live.
Contacts:
Implemented by Vladyslav Havriutkin
GitHub