Brownian tree: Difference between revisions
m
→{{header|Uiua}}: layout
m (→{{header|Uiua}}: layout) |
|||
| (6 intermediate revisions by 3 users not shown) | |||
Line 1,447:
=={{header|EasyLang}}==
[https://easylang.
<syntaxhighlight>
Line 4,959:
world[py][px] := 1;
rect(SCALE * pred(px), SCALE * pred(py), SCALE, SCALE, white);
bumped := TRUE;
else
Line 4,967:
until bumped;
end for;
end func;</syntaxhighlight>
Original source: [http://seed7.sourceforge.net/algorith/graphic.htm#brownian_tree]
=={{header|SequenceL}}==
'''SequenceL Code:'''<br>
Line 5,426 ⟶ 5,419:
:Pause
:RecallGDB 0</syntaxhighlight>
=={{header|Uiua}}==
Uiua Pad will show well-shaped arrays as images directly. If running locally you can uncomment the final few lines to save it as a file instead. (Running local is ~10 times faster too.)
The main move loop passes round a pair of points: here and previous position, so when we hit a set cell we can just back up one.
<syntaxhighlight lang="Uiua">
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"
</syntaxhighlight>
Or if you like your code terse :-)
<syntaxhighlight lang="Uiua">
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
</syntaxhighlight>
{{out}}
[[File:UiuaBrownianTree.png|thumb|center||Sample with higher values than provided code]]
=={{header|Visual Basic .NET}}==
Windows Forms Application.
| |||