One-dimensional cellular automata: Difference between revisions
One-dimensional cellular automata (view source)
Revision as of 00:54, 29 October 2013
, 10 years ago→More sophisticated
Line 3,133:
def (gen l)
uca+collect+for i 0 (i < len.l) ++i
yield (next (l i-1) l.i (l i+1))
# next state of b, given neighbors a and c
|