91
edits
Changes
→The Game of Life
=== References ===
''All the research is based from the following resources:''
*Comway's Game Of Life - [http://www.math.cornell.edu/~lipa/mec/lesson6.html]
*
*
'''Entry on: November 27th 2016 by Luv Kapur'''
=== Comway's Game of Life - Algorithm Description ===
Comway's Game of Life is a algorithmic representation of cellular automation. The game is played on an infinite two-dimensional rectangular grid of cells. Each cell has two probable states, alive or dead. Depending on the state of that cell's 8 neighbors, the state of each cell changes each turn of the game, constituting a unique generation on every computation . Neighbors of a cell are cells that touch that cell, either horizontal, vertical, or diagonal from that cell.
The initial pattern is the first generation. The second generation evolves from applying the rules simultaneously to every cell on the game board, i.e. births and deaths happen simultaneously. Afterwards, the rules are iteratively applied to create future generations. For each generation of the game, a cell's status in the next generation is determined by a set of rules. These simple rules are as follows:
* If the cell is alive, then it stays alive if it has either 2 or 3 live neighbors
* If the cell is dead, then it springs to life only in the case that it has 3 live neighbors
