Conways Game Of Life

A Conways Game Of Life is a cellular automaton which consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood (usually including the cell itself) is defined relative to the specified cell. An initial state (time t=0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood. Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the Probabilistic Cellular Automata and asynchronous cellular automaton.
                              The game is usually a zero-player game i.e the evolution is by its initial value that is provided by a random number generator. The game has following rules. 

1. Any live cell with fewer than two live neighbours dies, as if caused by under-population.
2. Any live cell with two or three live neighbours lives on to the next generation.
3. Any live cell with more than three live neighbours dies, as if by overcrowding.
4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

 Many different types of patterns occur in the Game of Life, including still lifes, oscillators, and patterns that translate themselves across the board.Some of them frequently occurs all depends on the initial position(seed).
The different patterns are: 

Oscillators                                              Still Lifes                                           Spaceships

                      

By including all the patterns here is the whole Game!!!!!