aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-02-01 16:33:20 -08:00
parent 5150844a7d
commit 4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
Download patch file Download diff file Expand all files Collapse all files

28
Task/Maze-generation/Uiua/maze-generation.uiua
View file

@ -1,33 +1,29 @@
# Build and solve a maze.
# Experimental!
W ← 10
H ← 6
W ← 16
H ← 8
GetWall ← -:⊡1:÷2/-.
GetWall ← -⊃⋅∘∘⊡1⊃⋅∘∘÷2⊸/-
# ([here, next], maze) -> (maze')
BreakWall ← ⍜(⊡|⋅@ )GetWall
Nfour ← +⊙¤[¯2_0 2_0 0_2 0_¯2] # Gives N4
Shuffle ← ⊏⍏[⍥⚂]⧻.
# (pos maze) -> T if it's already a star.
IsVisited ← ≠@.⊡
MarkAsVisited ← ⟜(⍜⊡⋅@.)
# (pos) -> (bool)
InBounds ← ▽⊸≡(↧⊃(/↧≥1_1|/↧< +1 × 2 H_W))
N₄ ← +⊙¤[¯2_0 2_0 0_2 0_¯2]
Shuffle ← ⊏⍏⍥⚂⊸⧻
# (pos maze) -> T if it's already seen (or out of bounds).
IsVisited ← ≠@\s⬚@\s⊡
MarkAsVisited ← ⟜(⍜⊡⋅@\s)
# (here, maze) -> (maze')
Walk ← |2 (
MarkAsVisited
# (here, maze) -> ([[here, next] x(up to)4], maze)
≡⊟¤⟜(Shuffle InBounds Nfour)
≡⊟¤⟜(Shuffle N₄)
# Update maze for each in turn. For each, if it
# still isn't visited, break the wall, recurse into it.
∧(⨬(◌|Walk⊡1⟜BreakWall)IsVisited◌°⊟,,)
∧(⨬(◌|Walk⊡1⟜BreakWall)IsVisited◌°⊟⊃⊙∘⊙∘)
)
# Generate a maze.
Maze ← (
↘¯1☇1↯(+1H)⊟⊂/⊂↯W"+-" @+⊂/⊂↯W"| " @| # Build a filled maze.
Walk 1_1 # Walk around breaking walls.
↘¯1♭₂↯(+1H)⊟⊂/⊂↯W"+-" @+⊂/⊂↯W"|." @| # Build a filled maze.
Walk 1_1 # Walk around eating dots and breaking walls.
)
Maze