Conway's Game of Life

Conway’s Game of life is a Cellular automata. The universe is an infinite two dimensional orthogonal grid consisting of square cells. At any given time each cell is either alive or dead. As time progresses discretely, the status of each cell is determined by the number of live cells in the 8 most adjacent squares of the cell.

Let n(x) be the number of lives cells in the 8 most adjacent squares of square x at time t. As time moves to t+1

• If n(x) <= 1, then x dies or stays dead (from under population).
• If n(x) > 3, then x dies or stays dead (from over population).
• if n(x) = 3, then x is born or stays alive.
• if n(x) = 2, then x maintains status.

In this implementation you can do the following:

• Select one of the Sample patterns and click start to let time progress.
• or Click new and create a pattern by clicking squares and then press start button.