Life-like Cellular Automaton

Instructions:

Start to run the simulation.
Stop to pause the simulation.
Step to step one generation forward.
Reset to re-seed the cells and return to the 0th generation.
Simulation speed sets the frames per second.
Seed probability sets the probabilty that a cell is alive (orange) when the grid is reset.
Rules provides a select menu for different types of cellular automaton rules.
Click on the grid to draw out your own initial pattern. Then, click start to watch it evolve!

An explanation of cellular automaton rules:
This cellular automaton engine performs its calculations on an infinite two-dimensional grid of square cells, each of which is in one of two possible states, alive or dead. Every cell's mortality in the subsequent generation is determined by its Moore neighborhood, which are the eight cells that are horizontally, vertically, or diagonally adjacent. The rules that determine whether a cell is born, remains alive, or dies causes the cellular automaton to evolve in interesting ways. A popular example of these rules is Conway's Game of Life, also known simply as Life. Since Life's inception, new similar cellular automata have been developed. The standard Game of Life is symbolised as "B3/S23": a cell is "Born" if it has exactly 3 neighbours, a cell "Stays alive" if it has 2 or 3 living neighbours, or the cell dies otherwise. Try different sets of rules to see different patterns emerge.