I was thinking about a CA type about a month ago. It uses a 1d equivalent of the Margolus neighborhood and returns X of the rule string if the pair is permutation X. It creates some really cool patterns such as the Sierpinski triangle on rule 0110 (equivalent to the XOR logic gate) or rule 30 (Yes, wolfram rule 30, yes in a neighborhood size of 2 inside of 3. Absolutely no idea how it got there). It is now described at https://en.wikipedia.org/wiki/Cellular_ ... d_automata and https://softologyblog.wordpress.com/202 ... -automata/
It's implemented at https://softology.com.au/voc.htm (sadly closed source). Play around with the ruleset and send me your favorite rules in this thread.
Combinations Cellular Automata
-
Apollyon094
- Posts: 3
- Joined: March 4th, 2020, 11:19 am
Re: Combinations Cellular Automata
This one, 021210201 has a glider destroying the entire pattern

This one, 201112100 mimics the patterns of counting in binary (see the right edge)


This one, 201112100 mimics the patterns of counting in binary (see the right edge)
