With this advanced level definition, you can recreate any of the 256 elementary cellular automata, as described by S. Wolfram in 2002, in his book “A New Kind of Science“. You can create a ruleset, by means of 8 boolean toggles, according to Wolfram’s classification.
The ruleset solver is written in a Python component and the iteration is carried out with Anemone.
This definition was written in GH v 0.9.0076. Please use it “as is”, it does not come with warranties.
Please do send through edits or implementations.
A snapshot of the component sequence can be found below.
Use the link below to download
Download 1D Cellular Automata
[sdfile url=”https://drive.google.com/file/d/0B4i0k1kw6ntMVmZWcS1PVmstdjg” title =”Download the 1D Cellular Automata Definition by Subscribing to our News”]


