We explore a wide variety of behaviours possible with Developmental Graph Cellular Automata. We use novelty search to find more extreme types of behaviour in terms of transient length and attractor cycle length. This also serves as a proof-of-concept that the system is evolvable. We then examine in more detail some individual examples of interesting behaviour, particularly focusing on cases where the graph divides into two or more separate components.

This content is only available as a PDF.
This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.