Data update

Task/Brownian-tree/Seed7/brownian-tree.seed7

@@ -34,7 +34,7 @@ const proc: genBrownianTree (in integer: fieldSize, in integer: numParticles) is
           # Bumped into something
           world[py][px] := 1;
           rect(SCALE * pred(px), SCALE * pred(py), SCALE, SCALE, white);
-          DRAW_FLUSH;
+          flushGraphic;
           bumped := TRUE;
         else
           py +:= dy;
@@ -43,11 +43,3 @@ const proc: genBrownianTree (in integer: fieldSize, in integer: numParticles) is
       until bumped;
     end for;
   end func;
-
-const proc: main is func
-  begin
-    screen(SIZE * SCALE, SIZE * SCALE);
-    KEYBOARD := GRAPH_KEYBOARD;
-    genBrownianTree(SIZE, 20000);
-    readln(KEYBOARD);
-  end func;

Task/Brownian-tree/Uiua/brownian-tree-1.uiua

@@ -0,0 +1,21 @@
+S ← 80
+# Create SxS grid, and set the centre point as seed.
+⍜⊡(+1)↯2⌊÷2S ↯ S_S 0
+
+RandInt ← ⌊×⚂
+RandPoint ← ([⍥(RandInt S)2])
+# Update the pair to be a new adjacent [[Here] [Last]]
+Move ← ⊟∵(-1+⌊RandInt 3).⊢
+In ← /××⊃(≥0)(<S) # Is this point in bounds?
+# Given a grid return a free point pair and that grid.
+SeedPair ← ⊟.⍢(RandPoint ◌)(=1⊡) RandPoint
+# Find next adjacent position, or new seed if out of bounds.
+Next ← ⟨SeedPair ◌|∘⟩:⟜(In ⊢)Move
+# Start from a new Seed Pair and move until you hit the tree. Add the prior pos to the tree.
+JoinTree ← ⍜⊡(+1)◌°⊟⍢Next (=0⊡⊢) SeedPair
+# Do it multiple times.
+⍜now⍥JoinTree500
+
+# ◌
+# &ime "png"
+# &fwa "BrownianTree.png"

Task/Brownian-tree/Uiua/brownian-tree-2.uiua

@@ -0,0 +1,6 @@
+S ← 80
+⍜⊡(+1)↯2⌊÷2S↯S_S0
+Rp ← (⊟⍥(⌊×⚂S)2)
+Sd ← ⊟.⍢(Rp◌)(=1⊡) Rp
+Nx ← ⟨Sd◌|∘⟩:⟜(/××⊃(≥0)(<S)⊢)⊟∵(-1+⌊×⚂3).⊢
+⍜now⍥(⍜⊡(+1)◌°⊟⍢Nx(=0⊡⊢)Sd)500