My implementations and experiments with different cellular automata. Automata generated here are based on Stephen Wolfram's "A New Kind of Science". Three different types of cellular automata are showcased here: binary, three color totallistic, continuous.
Some quick theory:
- Binary cellular automata are the simplest possible implementation. Each of the cells is either full or empty. The value of the next generation cell depends on the value of the current generation cell and it's two neighbours. In consequence each automata can be described by a rule with 2^3 cases. There are 2^8(256) possible rules for this type of automata.
- Three color totallistic cellular automata works slightly differently. Each of the cells can take three values (empty, kind of empty?hehe and full). The next generation cell value depends on the average value of current cell and it's neighbours. Each automata of this type can be describest by a rule with 7 cases. There are 3^7(2187) possible rules.
- Continuous cellular automata is a non-discrete version of a cellular automata, each of the cells can have a value limited only by the computer's precision (I use 32-bit floating point). Similaraly to the three color totallistic rule - this one also take an average of 3 cells. Afterwards any computiation can be applied, I follow Wolfram's book and compute the value of next cell using following formula c(c_l,c_c,c_r)=fractional_part(avg(c_l,c_c,c_r)-rule_const)
Samples:
- Binary
- Three color totallistic
- Continuous
