Abstract

The paper presents a special technique, called conditionally matching rules, for the representation of transition functions of cellular automata and its application to the evolutionary design of complex emergent behaviour. The square calculation in one-dimensional cellular automata and the problem of designing replicating loops in two-dimensional cellular automata will be treated as case studies. It will be shown that the evolutionary algorithm in combination with the conditionally matching rules is able to successfully solve these tasks and provide some innovative results in comparison with the existing solutions. The results represent successful solutions of problems in cellular automata discovered using conditionally matching rules, for which the utilisation of conventional techniques has failed. Original publication: M. Bidlo, On Routine Evolution of Complex Cellular Automata, in IEEE Transactions on Evolutionary Computation, vol.PP, no.99, doi: 10.1109/TEVC.2016.2516242, URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7377086&isnumber=4358751

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.