• New Entry

Cellular automaton, rule 30

Eric Ogier on 29 Oct 2021
  • 1
  • 16
  • 0
  • 0
  • 138
N=bitget(30,1:8);
D=150;
A=zeros(D,2*D);
A(1,D)=1;
for n=1:D-1
for m=2:(2*D-1)
A(n+1,m)=N(A(n,[m-1 m m+1])*[4 2 1]'+1);
end
end
imagesc(A);
axis off equal;
Remix Tree