Elementary Wolfram Celular Automaton

A set of rules dictates the behaviour of this one dimensional cellular automaton (akin Conway's Game of Life which is a 2D CA). Some interesting rules to try:

Click to pause/resume. This one dimensional automaton is drawn in a 2D grid, the second axis acting like a time axis (so each row is one full CA state, and frames are drawn on each rows.

Compare the texture generated by rule 30 or 110 for instance to the one observed on the shell of the Textile Cone shell:

Snail image
Rules (Wolfram elementary CA):
8-bit int represent a rule, i.e. 8 different neighbour combinations where we have:
        [] [] [] 
        /  |   \
     left  |   right
         current
Each bit is representing the future state ("1" for alive, "0" for dead) of a cell given the configuration:
bit 0: [x][x][x]
bit 1: [x][x][ ]
bit 2: [x][ ][x]
bit 3: [x][ ][ ]
bit 4: [ ][x][x]
bit 5: [ ][x][ ]
bit 6: [ ][ ][x]
bit 7: [ ][ ][ ]

So rule "01011010" would make a cell die in config 0, live in config 1 and so on...
(the above binary string is the representation of the rule 90)