Life-Like Cellular Automata are a concept for the iterative simulation of cell evolution. In each iteration (=generation) a cell is either in state “alive” or “dead”. To determine the state of the next generation the living neighbors in vertical, horizontal and diagonal direction are counted. The cell will be set to alive if this number meets one of a predefined set of birth rules for dead cells and survival rules for living cells.
The original concept assumes the cells to be arranged in a 2D grid. With this and the rule set “dead cell born for 3 living neighbors” and “living cell dying for 2 or 3 living neighbors” (denoted B3/S23) the popular Conway’s Game of Life as introduced by John Conway in 1970 results.
The concept can be extended to a 3D grid and to more than 2 cell states. With more than 2 states a cell dies not immediately after no survival rule applies. Instead, its state decreases from generation to generation starting with the highest state (=number of states minus one) till it reaches state 0 (= “dead”). During dying no rules apply to the specific cell and for the neighbor count of adjacent cells it is considered dead.

LiliCADroid lets you simulate Life-Like Cellular Automata on your Android device.

Features:
• Set grid edge length up to 30 cells
• Change grid shape between cubical and spherical
• Choose between 2D and 3D grid
• Set up start configuration manually or randomly
• Edit birth/survival rules and state number
• Simulate generations continually or generation by generation
• Vary simulation speed
• Switch between full and cross sectional view
• Orbit and zoom
• Modify simulated generation by re-entering start setup

For further information on Life-Like Cellular Automata visit:
https://en.wikipedia.org/wiki/Life-like_cellular_automaton

LiliCADroid: Life-Like Cellula