This is an implementation of Elementary cellular automatons using 4 and 8 states. Use the buttons below to get a random rule and then click on them to see how it works.
The rules work the same as the binary version. The new cell is created based on its top three cells. Therefore, the 4-state version has 4^4^3 rules and the 8-state version has 8^8^3 rules. The rules are encoded using the 4 or 8 bases.
For example, `0331231021323021232102203331320233202330332212332130302103233310` is a rule for the 4 state automaton. This is one of the possible 4^4^3 rules and it encodes the new cell state for all of the 64 possible enumerations. The enumerations looks like this:
0 0 0 -> 0
0 0 1 -> 1
0 0 2 -> 2
0 0 3 -> 3
...
3 3 3 -> 63
Characters at each position of the rule string define the new cell state. For example, if the top three cells are 231, which is 45 in base 10, the 45th character is used. In the above rule it is 2, so the new cell state will be 2.