Life Like Cellular Automata

Cellular Automata is a discrete grid based system which consists of cells that update themselves following a certain ruleset over discrete time chunks called generations. Conway’s game of life is the most famous one of these, but is only 1 subset of a larger set of life-like cellular automata.

In Conways game of life, each cell can either be one of 2 states, dead or alive. Its’s updating ruleset is:

• A node is ‘born’ if it has 3 neighbours, changing state from dead to alive
• A node survives if it is alive and has either 2 or 3 neighbours, else it reverts back to a dead state

This ruleset can be written in the form of B3/S23 and is just one of many other rules that can exist in life-like Cellular Automata.

In this update, I have added boxes that you can turn on or off to customise the cellular automa to any rule you want.
My next goals are to:

• Make the grid editable so you can create your own systems
• Make a rewind button so you can see how different structures are formed
• Create a slider to control simulation speed