Wednesday, February 19, 2020

Combinations Cellular automata

I thought up a 1D cellular automata that has a neighborhood size of 2 that checks odd/even indexed pairs, staring odd and returns any number smaller than the number of states (this is based on the rulestring). If the rulestring is (2^X) characters long, there are X+1 states. It doesn't look that interesting in 2 states except the fact that XOR (rule 6) makes a Sierpinski triangle.
The only other logic gate that has a 50/50 chance of returning a 1 or a 0 is XNOR. it did some sort of inverted Sierpinski triangle.
With only 2 states, we get only 16 rules, which gets boring. Up to 3 states, things get interesting.
I call this one the disfigured Sierpinki.
Looks like a bunch of stretched Sierpinski's.
Images by Jason Rampe, made in Visions of Chaos https://softology.com.au/voc.htm




No comments:

Post a Comment