Now, why does this work? Because binom(m, n)(mod 2) = n XOR m, so this is just Pascal's triangle (mod 2).#!/usr/bin/perl -wl $_="co"; while (1) { s/..(?=c)/$&^"CO"/eg; s/^/ /; print; }
Update: Will work now.
In reply to Re: 1-D Cellular Automata
by gumby
in thread 1-D Cellular Automata
by YuckFoo
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |