Press space to begin. Rule 90, one of the most elementary of the CA family, is quite mesmerizing. This Cellular Automaton operates on a very interesting system. Here's a quick step-by-step description: 0. The traditional starting state of the array is a single true bit in the center. This can also be completely random, so go wild! 1. Similar to Conway's Game of Life (as well as many other CAs), Rule 90's first step is transferring data from a main array to a temporary copy. However, Rule 90 is unique due to its one-dimensional array system. 2. After the transfer is complete, the XOR logic gate is applied to each bit on the temporary variable, with the two inputs being the bits on the left and right of the selected bit. If you don't know, the specs for the XOR gate are 000, 101, 011, and 110. This can be simplified into "if the two neighboring bits are the same, return false, else, return true." The output of this function is the value of the selected bit. 3. Render (because Rule 90 is one-dimensional, the array is rendered in lines, starting from the top, and cascading to the bottom. This is entirely arbitrary, but I've colored bits based on the status of their neighbors: Blue = 0 0 Green = 1 0 Yellow = 0 1 Red = 1 1). 4. Repeat.
