Conway's Game Of Life

It is a two-dimensional orthogonal grid of square cells which are infinite. A cell has either of the two states; which is living (populated) or dead (unpopulated). The cells interact with each of their eight neighbour cells near them horizontally, vertically, or diagonally adjacent. At each iteration, the following transitions take place:



1. A living cell with less than two living neighbours dies due to underpopulation.

2. A living cell with two or three living neighbours lives on to become the next generation.

3. A living cell with more than three living neighbours dies due to overpopulation.

4. A dead cell with exactly three living neighbours becomes a living cell due to reproduction.





These rules compare the behaviour of the automaton to real life. They can be demystified into the following:



1. A living cell with two or three living neighbours survives.

2. A dead cell with three living neighbours becomes a living cell.

3. All other living cells die in the next generation. In the same way, all other dead cells stay dead.



This initial pattern constitutes the seed of the system. The 1st gen is created by applying the above rules simultaneously to every cell in the seed, living or dead. Since births and deaths occur simultaneously, and this discrete moment when this happens is called a tick. Each new generation exists as a pure function of the preceding generation. The rules continue to be applied repeatedly in multiple iterations to create further generations.





*Terms & Conditions Applied

https://conways-game-of-life.blogspot.com/2022/02/conways-game-of-life.html