Another 2D continuous automata video.

Each pixel has a value between 0 and 1. At each iteration, each pixel's value is replaced by a value given by a function of the values of the 8 adjacent pixels, sorted so that the result is non-directional.

Click to embiggen on Vimeo.

continuous automata - conditional - G from Matthew Conroy on Vimeo.

More cellular automata. This time using a non-linear function of the pixels, implemented as a couple conditional statements in the code.

Click through to embiggen on Flickr.

cellular automata - conditional - A from Matthew Conroy on Vimeo.

More cellular automata.

I decided to try ones made using just the 8 adjacent neighbors, and not the 24 adjacent and near-adjacent neighbors. This one turned out really interesting.

Click through to Vimeo to embiggen and see other videos.

cellular automata - 8 neighbors - A from Matthew Conroy on Vimeo.

Another, but higher resolution, quasi-cellular automata video.

Each pixel has a value between 0 and 1. At each iteration, each pixel's value is replaced by a value given by a linear function of the values of the 24 adjacent and next-adjacent pixels, sorted so that the result is non-directional. With 24 coefficients, there are a lot of possible results; this is one that appeared to be of some interest.

The coefficients of this linear function are given by -0.1+0.012*i, i going from 0 to 23.

Made with processing.org

Click to embiggen on Vimeo.

cellular automata -0.1+0.012*i from Matthew Conroy on Vimeo.

Another cellular automata experiment video. This one came out pretty nice. It starts with noise, and then at each iteration, each pixel is replaced by the value of a linear function of the 24 adjacent and next-to-adjacent pixels. With 24 coefficients (25 if we throw in a constant), many such functions are possible (and that's just linear ones). How to find "all" resulting "interesting" automata? Hmmmm.

More messing around with cellular automata using Processing.