Changes

* Comway's Game Of Life - [http://www.math.cornell.edu/~lipa/mec/lesson6.html]*[http://web.mit.edu/sp.268/www/2010/lifeSlides.pdf]

Comway's Game of Life is a algorithmic representation of cellular automationdeveloped 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.

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:

=== Comway's Game of Life - Rules ===The rules of the game are simple, and describe the next generation of cells in the grid:* If the Birth: a cell that is dead at time t will be alive, then it stays at time t +1 if exactly 3 of its eight neighbors were alive at time t* Death: a cell can die by:** Overcrowding: if it has either 2 a cell is alive at time t + 1 and 4 or 3 live more ofits neighborsare also alive at time t, the cell will be dead attime t + 1.* * Exposure: If the a live cell is deadat time t has only 1 live neighbor or nolive neighbors, then it springs will be dead at time t + 1.* Survival: a cell survives from time t to life time t + 1 if and only in the case that it has if 2 or 3 live of its neighborsare alive at time t.