Click & Drag your mouse across the grid to populate squares

Populated squares with less than two neighbors or more than three neighbors will die

Populated squares with two or three neighbors stay alive
Unpopulated squares with exactly three neighbors will be populated

Press the space bar to evolve once, hold to continue evolving
Press M to bring up this menu again!
Press $ to start/stop Raving!
Press to Play

Conway's Game of Life is a Cellular Automoton.
Cellular Automota, or CA's, are often studied in mathematics and Computer Science

They are defined by a grid of cells all in finite states, such as on or off.
An initial state is selected and then each generation evolves based on a certain set of rules.

Conway's Game Of Life was the first CA to gain popularity outside of Academia.

This popularity mainly comes from the surprising ways patterns can evolve from simple rules. It's even Turing Complete!
To read more about the fascinating world of CA's, here are a couple interesting resources:
Conway's Game Of Life Forum Wikipedia

Check out these sprites! See if you can make some!