Conways Game of Life

Runs the classic Conway's Game of Life simulation on a 2d grid. You can use either HASH's built-in 'conway' behavior, or the written out "gol_cell".

A cell is either alive or dead. A live cell remains alive if it has 2 or 3 neighbors, otherwise it dies. A dead cell will only become live if it has exactly 3 neighbors.

You can use a number of preset starting conditions or begin with a random configuration by modifying the values in the Properties tab.