Josh Grosse – Contact
Cellular automata are mathematical systems where the states of cells change based on the states of others nearby. One of the best known is Conway’s Game of Life, in which the only states are alive and dead, determined by the number of living neighbours in a square lattice. His rules are that new cells are born with 3 neighbours and cells with 2 or 3 neighbours survive, written B3/S23 for short, but other combinations can also show interesting behaviour.
Many patterns have been discovered, for which see conwaylife.com and links. I have mostly only included simple ones here; my main goal has been to give at least one stable pattern for every set of rules that allows them. This is unfortunately incomplete for many rules with B2/S1 but hopefully the results are still of some interest anyway.
You should be able to double-click on patterns to bring them up in RLE format and they are all in a table here. If anything else might be helpful to add please let me know.