The Game of Life was created in 1970 by a British mathematician John Conway.

My first implementation of the game was in Fortran for PDP-11 some 20 years ago. Last year I used The Game of Life as an excuse to play with the Microsoft Windows Presentation Foundation (WPF). And now I present the MS Silverlight implementation for the web.

The game's description below is taken from Wikipedia.

The universe of the Game of Life is an infinite two-dimensional grid of square cells, each of which is in one of two possible states, live or dead. Every cell interacts with its eight neighbors, which are the cells that are directly horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:

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

The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seed—births and deaths happen simultaneously, and the discrete moment at which this happens is sometimes called a tick (in other words, each generation is a pure function of the one before). The rules continue to be applied repeatedly to create further generations.

To play the game click here: Play the Game of Life.