Data update

Task/One-dimensional-cellular-automata/C/one-dimensional-cellular-automata-3.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include <string.h>
+
+#define SIZE 21
+
+void print_gen(int gen[], int size) {
+    for (int i = 0; i < size; i++) {
+        printf("%c", gen[i] ? '#' : '_');
+    }
+    printf("\n");
+}
+
+void evolve(int gen[], int size) {
+    int next_gen[size + 2];
+    next_gen[0] = next_gen[size + 1] = 0;
+
+    for (int i = 0; i < size; i++) {
+        next_gen[i + 1] = gen[i];
+    }
+
+    for (int i = 0; i < size; i++) {
+        gen[i] = (next_gen[i] + next_gen[i + 1] + next_gen[i + 2]) == 2;
+    }
+}
+
+int main() {
+    char initial[] = "_###_##_#_#_#_#__#__";
+    int gen[SIZE];
+
+    for (int i = 0; i < SIZE; i++) {
+        gen[i] = initial[i] == '#';
+    }
+
+    for (int n = 0; n < 10; n++) {
+        print_gen(gen, SIZE);
+        evolve(gen, SIZE);
+    }
+
+    return 0;
+}

Task/One-dimensional-cellular-automata/Refal/one-dimensional-cellular-automata.refal

@@ -0,0 +1,39 @@
+$ENTRY Go {
+    , ' ### ## # # # #  #  ': e.State
+    = <Run <Table> 10 e.State>;
+};
+
+Table {
+    = ((('   ') ' ')
+       (('  #') ' ')
+       ((' # ') ' ')
+       ((' ##') '#')
+       (('#  ') ' ')
+       (('# #') '#')
+       (('## ') '#')
+       (('###') ' '));
+};
+
+Run {
+    t.Table 0 e.X = ;
+    t.Table s.Steps e.X =
+        <Prout e.X>
+        <Run t.Table <- s.Steps 1> <DoStep t.Table e.X>>;
+};
+
+DoStep {
+    t.Table e.X = <Step1 t.Table ' ' e.X ' '>;
+};
+
+Step1 {
+    t.Table s.1 s.2 s.3 e.R,
+        <Lookup t.Table s.1 s.2 s.3>: e.Next,
+        e.R: {
+            = e.Next;
+            e.R = e.Next <Step1 t.Table s.2 s.3 e.R>;
+    };
+}
+
+Lookup {
+    (e.A ((e.X)e.Y) e.B) e.X = e.Y;
+};

Task/One-dimensional-cellular-automata/Uiua/one-dimensional-cellular-automata.uiua

@@ -0,0 +1,4 @@
+Rule ← /+⊞= ⊓(⊚⋯|°⋯⇌◫3⇌ ⊂⊂0:0)
+[⍥(⁅⚂)200]          # Init
+⇌[⍥(Rule104.)⌊÷2⧻.] # Run
+▽⟜(≡▽)4             # Scale up