tasks a-s

Task/One-dimensional-cellular-automata/D/one-dimensional-cellular-automata.d

@@ -0,0 +1,19 @@
+import std.stdio, std.algorithm;
+
+void main() {
+   enum ngenerations = 10;
+   enum initial = "0011101101010101001000";
+   enum table = "00010110";
+
+   char[initial.length + 2] A = '0', B = '0';
+   A[1 .. $-1] = initial;
+   foreach (_; 0 .. ngenerations) {
+      foreach (i; 1 .. A.length-1) {
+         write(A[i] == '0' ? '_' : '#');
+         int val = (A[i-1]-'0' << 2) | (A[i]-'0' << 1) | (A[i+1]-'0');
+         B[i] = table[val];
+      }
+      swap(A, B);
+      writeln();
+   }
+}