Brownian tree: Difference between revisions

← Older edit

Brownian tree (view source)

Revision as of 16:51, 30 June 2024

1,594 bytes added , 7 days ago

→‎{{header|Locomotive Basic}}: add screenshot

Morn

67

edits

Revision as of 13:09, 20 March 2024 (view source) Thomas mertes (talk \| contribs) m (Replace deprecated functions) ← Older edit		Latest revision as of 16:51, 30 June 2024 (view source) Morn (talk \| contribs) (→‎{{header\|Locomotive Basic}}: add screenshot)
(5 intermediate revisions by one other user not shown)
Line 2,798: =={{header\|Locomotive Basic}}== {{trans\|ZX Spectrum Basic}} [[File:Cpcbasic brownian.png\|thumb\|Output]] This program is ideally run in [https://benchmarko.github.io/CPCBasic/cpcbasic.html CPCBasic] and should finish after about 20 to 25 minutes (Chrome, desktop CPU). At normal CPC speed, it would probably take several days to run when set to 10000 particles. <syntaxhighlight lang="locobasic">10 MODE 1:DEFINT a-z:RANDOMIZE TIME:np=10000 Line 2,815 ⟶ 2,816: 1020 y=RND*400 1030 RETURN</syntaxhighlight> =={{header\|Lua}}== The output is stored in as a ppm-image. The source code of these output-functions is located at Line 5,419 ⟶ 5,421: :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.