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.
@inproceedings(Waldegrave++:2023-ALife2, author = "Riversdale Waldegrave and Susan Stepney and Martin Trefzer", title = "Exploring the Rich Behaviour of Developmental Graph Cellular Automata", pages = "430-438", doi = "10.1162/isal_a_00666", crossref = "ALife-2023" ) @proceedings(ALife-2023, title = "ALife 2023, Sapporo, Japan, July 2023", booktitle = "ALife 2023, Sapporo, Japan, July 2023", publisher = "MIT Press", year = 2023 )