91
edits
Changes
→References
* Comway's Game Of Life - Rules - [http://web.mit.edu/sp.268/www/2010/lifeSlides.pdf]
* Example Generations - [https://en.wikipedia.org/wiki/Conway's_Game_of_Life]
* Serial Implementation - [https://rosettacode.org/wiki/Conway%27s_Game_of_Life#C.2B.2B]
'''Entry on: November 27th 2016 by Luv Kapur'''
----
=== Algorithm Description ===
Comway's Game of Life is a algorithmic representation of cellular automation developed by John Conway in 1970. 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.
