Cellular automata is a set of conditions for which cellular behaviour within a closed grid system is generated. They are loneliness, over crowding and birth conditions. Each condition is numerical and upon its implementation produces activity of cells before and after its state.
The method to evaluate successful automata was based on conditions of repetition, symmetry and stability. The initial pattern governs a lot of the conditions that are generated: rule-sets are more responsive to patters that are central or geometric. The cross patters (starting conditions) generate almost all conditions on most rule sets. Grid systems help in creating bilaterally symmetrical systems and are more prone to producing gliders on certain rule-sets.
Rule-sets are the most effective way to understand patters that are generic, for example cyclic patters that are generic, for example cyclic patters for most start-up images that are centrally aligned produce symmetrical results.
