Comparison of Evolutionary Development of Cellular Automata Using Various Representations

evolutionary algorithm, development cellular automaton, representation, transition function, pattern development

A comparative study is presented regarding the evolutionary design of complex multi-state cellular automata. In particular, two-dimensional cellular automata will be considered in combiniation with pattern development problem as a~case study. Two techniques for the representation of transition functions for the cellular automata are proposed: a~conventional table-based method and an advancced concept utilising conditionally matching rules. It will be shown that using a~proper settings of Evolution Strategy, various working solutions can be obtained using both representations. Some observations from an analysis of resulting cellular automata will be presented which indicate that the behavior of the automata is totally different and depends on the representation applied. Specifically, the table representation exhibit a~chaotic development during which a~target pattern emerges at a~moment. On the other hand, the conditional rules are able to achieve behavior that progressively constructs the target pattern which, in addition, represents a~stable final state. Moreover, the latter method also exhibits significantly higher success rate which represents one of its advantages and proves an importance of systematic research in this area.