Conway's game of life

Conways's Game of Life is a simulation of the evolution of a population of simple organisms. Every pixel represents one cell and it can be in one of two states: present (alive) or empty (dead), the former represented by a one and the latter a zero, and an illuminated or black pixel. The rules for each generation are quite simple.

Rules

The rules for each generation are quite simple: The organism will be alive in the next generation if it either:

   Is alive and has two or three neighbors
   Is dead and has exactly three neighbors

An example implementation in BASIC can be found here.