Data update
This commit is contained in:
Ingy döt Net
parent
29a5eea0d4
commit
5c1bb7bfa9
2011 changed files with 35081 additions and 3229 deletions
|
|
@ -3,7 +3,7 @@ F make_maze(w = 16, h = 8)
|
|||
V ver = [[‘| ’] * w [+] [String(‘|’)]] * h [+] [[String]()]
|
||||
V hor = [[‘+--’] * w [+] [String(‘+’)]] * (h + 1)
|
||||
|
||||
F walk(Int x, Int y) -> N
|
||||
F walk(Int x, Int y) -> Void
|
||||
@vis[y][x] = 1
|
||||
V d = [(x - 1, y), (x, y + 1), (x + 1, y), (x, y - 1)]
|
||||
random:shuffle(&d)
|
||||
|
|
|
|||
56
Task/Maze-generation/Chapel/maze-generation.chapel
Normal file
56
Task/Maze-generation/Chapel/maze-generation.chapel
Normal file
|
|
@ -0,0 +1,56 @@
|
|||
use Random;
|
||||
|
||||
config const rows: int = 9;
|
||||
config const cols: int = 16;
|
||||
if rows < 1 || cols < 1 {
|
||||
writeln("Maze must be at least 1x1 in size.");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
enum direction {N = 1, E = 2, S = 3, W = 4};
|
||||
|
||||
record Cell {
|
||||
var spaces: [direction.N .. direction.W] bool;
|
||||
var visited: bool;
|
||||
}
|
||||
|
||||
const dirs = [
|
||||
((-1, 0), direction.N, direction.S), // ((rowDir, colDir), myWall, neighbourWall)
|
||||
((0, 1), direction.E, direction.W),
|
||||
((1, 0), direction.S, direction.N),
|
||||
((0, -1), direction.W, direction.E)
|
||||
];
|
||||
|
||||
var maze: [1..rows, 1..cols] Cell;
|
||||
var startingCell = (choose(maze.dim(0)), choose(maze.dim(1)));
|
||||
|
||||
checkCell(maze, startingCell);
|
||||
displayMaze(maze);
|
||||
|
||||
proc checkCell(ref maze, cell) {
|
||||
maze[cell].visited = true;
|
||||
for dir in permute(dirs) {
|
||||
var (offset, thisDir, neighbourDir) = dir;
|
||||
var neighbour = cell + offset;
|
||||
if maze.domain.contains(neighbour) && !maze[neighbour].visited {
|
||||
maze[cell].spaces[thisDir] = true;
|
||||
maze[neighbour].spaces[neighbourDir] = true;
|
||||
checkCell(maze, neighbour);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
proc displayMaze(maze) {
|
||||
for row in maze.dim(0) {
|
||||
for col in maze.dim(1) {
|
||||
write(if maze[row, col].spaces[direction.N] then "+ " else "+---");
|
||||
}
|
||||
writeln("+");
|
||||
for col in maze.dim(1) {
|
||||
write(if maze[row, col].spaces[direction.W] then " " else "| ");
|
||||
}
|
||||
writeln("|");
|
||||
}
|
||||
write("+---" * maze.dim(1).size);
|
||||
writeln("+");
|
||||
}
|
||||
181
Task/Maze-generation/POV-Ray/maze-generation.povray
Normal file
181
Task/Maze-generation/POV-Ray/maze-generation.povray
Normal file
|
|
@ -0,0 +1,181 @@
|
|||
#version 3.7;
|
||||
|
||||
global_settings {
|
||||
assumed_gamma 1
|
||||
}
|
||||
|
||||
#declare Rows = 15;
|
||||
#declare Cols = 17;
|
||||
|
||||
#declare Seed = seed(2); // A seed produces a fixed sequence of pseudorandom numbers
|
||||
|
||||
#declare Wall = prism {
|
||||
0, 0.8, 7,
|
||||
<0, -0.5>, <0.05, -0.45>, <0.05, 0.45>, <0, 0.5>,
|
||||
<-0.05, 0.45>, <-0.05, -0.45>, <0, -0.5>
|
||||
texture {
|
||||
pigment {
|
||||
brick colour rgb 1, colour rgb <0.8, 0.25, 0.1> // Colour mortar, colour brick
|
||||
brick_size 3*<0.25, 0.0525, 0.125>
|
||||
mortar 3*0.01 // Size of the mortar
|
||||
}
|
||||
normal { wrinkles 0.75 scale 0.01 }
|
||||
finish { diffuse 0.9 phong 0.2 }
|
||||
}
|
||||
}
|
||||
|
||||
#macro Fisher_Yates_Shuffle(Stack, Start, Top)
|
||||
#for (I, Top, Start+1, -1)
|
||||
#local J = floor(rand(Seed)*I + 0.5);
|
||||
#if (J != I) // Waste of time swapping an element with itself
|
||||
#local Src_Row = Stack[I][0];
|
||||
#local Src_Col = Stack[I][1];
|
||||
#local Dst_Row = Stack[I][2];
|
||||
#local Dst_Col = Stack[I][3];
|
||||
#declare Stack[I][0] = Stack[J][0];
|
||||
#declare Stack[I][1] = Stack[J][1];
|
||||
#declare Stack[I][2] = Stack[J][2];
|
||||
#declare Stack[I][3] = Stack[J][3];
|
||||
#declare Stack[J][0] = Src_Row;
|
||||
#declare Stack[J][1] = Src_Col;
|
||||
#declare Stack[J][2] = Dst_Row;
|
||||
#declare Stack[J][3] = Dst_Col;
|
||||
#end
|
||||
#end
|
||||
#end
|
||||
|
||||
#macro Initialise(Visited, North_Walls, East_Walls)
|
||||
#for (R, 0, Rows-1)
|
||||
#for (C, 0, Cols-1)
|
||||
#declare Visited[R][C] = false;
|
||||
#declare North_Walls[R][C] = true;
|
||||
#declare East_Walls[R][C] = true;
|
||||
#end
|
||||
#end
|
||||
#end
|
||||
|
||||
#macro Push(Stack, Top, Src_Row, Src_Col, Dst_Row, Dst_Col)
|
||||
#declare Top = Top + 1;
|
||||
#declare Stack[Top][0] = Src_Row;
|
||||
#declare Stack[Top][1] = Src_Col;
|
||||
#declare Stack[Top][2] = Dst_Row;
|
||||
#declare Stack[Top][3] = Dst_Col;
|
||||
#end
|
||||
|
||||
#macro Generate_Maze(Visited, North_Walls, East_Walls)
|
||||
#local Stack = array[Rows*Cols][4]; // 0: from row, 1: from col, 2: to row, 3: to col
|
||||
#local Row = floor(rand(Seed)*(Rows-1) + 0.5); // Random start row
|
||||
#local Col = floor(rand(Seed)*(Cols-1) + 0.5); // Random start column
|
||||
#local Top = -1;
|
||||
Push(Stack, Top, Row, Col, Row, Col)
|
||||
|
||||
#while (Top >= 0)
|
||||
#declare Visited[Row][Col] = true;
|
||||
#local Start = Top + 1;
|
||||
|
||||
#if (Row < Rows-1) // Add north neighbour
|
||||
#if (Visited[Row+1][Col] = false)
|
||||
Push(Stack, Top, Row, Col, Row+1, Col)
|
||||
#end
|
||||
#end
|
||||
|
||||
#if (Col < Cols-1) // Add east neighbour
|
||||
#if (Visited[Row][Col+1] = false)
|
||||
Push(Stack, Top, Row, Col, Row, Col+1)
|
||||
#end
|
||||
#end
|
||||
|
||||
#if (Row > 0) // Add south neighbour
|
||||
#if (Visited[Row-1][Col] = false)
|
||||
Push(Stack, Top, Row, Col, Row-1, Col)
|
||||
#end
|
||||
#end
|
||||
|
||||
#if (Col > 0) // Add west neighbour
|
||||
#if (Visited[Row][Col-1] = false)
|
||||
Push(Stack, Top, Row, Col, Row, Col-1)
|
||||
#end
|
||||
#end
|
||||
|
||||
Fisher_Yates_Shuffle(Stack, Start, Top)
|
||||
|
||||
#local Removed_Wall = false;
|
||||
#while (Top >= 0 & Removed_Wall = false)
|
||||
#local Src_Row = Stack[Top][0];
|
||||
#local Src_Col = Stack[Top][1];
|
||||
#local Dst_Row = Stack[Top][2];
|
||||
#local Dst_Col = Stack[Top][3];
|
||||
#declare Top = Top - 1;
|
||||
|
||||
#if (Visited[Dst_Row][Dst_Col] = false)
|
||||
#if (Dst_Row = Src_Row+1 & Dst_Col = Src_Col) // North wall
|
||||
#declare North_Walls[Src_Row][Src_Col] = false;
|
||||
#elseif (Dst_Row = Src_Row & Dst_Col = Src_Col+1) // East wall
|
||||
#declare East_Walls[Src_Row][Src_Col] = false;
|
||||
#elseif (Dst_Row = Src_Row-1 & Dst_Col = Src_Col) // South wall
|
||||
#declare North_Walls[Dst_Row][Src_Col] = false;
|
||||
#elseif (Dst_Row = Src_Row & Dst_Col = Src_Col-1) // West wall
|
||||
#declare East_Walls[Src_Row][Dst_Col] = false;
|
||||
#else
|
||||
#error "Unknown wall!\n"
|
||||
#end
|
||||
|
||||
#declare Row = Dst_Row;
|
||||
#declare Col = Dst_Col;
|
||||
#declare Removed_Wall = true;
|
||||
#end
|
||||
#end
|
||||
#end
|
||||
#end
|
||||
|
||||
#macro Draw_Maze(North_Walls, East_Walls)
|
||||
merge {
|
||||
#for (R, 0, Rows-1)
|
||||
object { Wall translate <1, 0, 0.5> translate <-1, 0, R> } // West edge
|
||||
#for (C, 0, Cols-1)
|
||||
#if (R = 0) // South edge
|
||||
object { Wall rotate y*90 translate <0.5, 0, 1> translate <C, 0, -1> }
|
||||
#end
|
||||
#if (North_Walls[R][C])
|
||||
object { Wall rotate y*90 translate <0.5, 0, 1> translate <C, 0, R> }
|
||||
#end
|
||||
#if (East_Walls[R][C])
|
||||
object { Wall translate <1, 0, 0.5> translate <C, 0, R> }
|
||||
#end
|
||||
#end
|
||||
#end
|
||||
translate <-0.5*Cols, 0, 0> // Centre maze on x=0
|
||||
}
|
||||
#end
|
||||
|
||||
camera {
|
||||
location <0, 13, -2>
|
||||
right x*image_width/image_height
|
||||
look_at <0, 2, 5>
|
||||
}
|
||||
|
||||
light_source {
|
||||
<-0.1*Cols, Rows, 0.5*Rows>, colour rgb <1, 1, 1>
|
||||
area_light
|
||||
x, y, 3, 3
|
||||
circular orient
|
||||
}
|
||||
|
||||
box {
|
||||
<-0.5*Cols, -0.1, 0>, <0.5*Cols, 0, Rows>
|
||||
texture {
|
||||
pigment {
|
||||
checker colour rgb <0, 0.3, 0> colour rgb <0, 0.4, 0>
|
||||
scale 0.5
|
||||
}
|
||||
finish { specular 0.5 reflection { 0.1 } }
|
||||
}
|
||||
}
|
||||
|
||||
#declare Visited = array[Rows][Cols];
|
||||
#declare North_Walls = array[Rows][Cols];
|
||||
#declare East_Walls = array[Rows][Cols];
|
||||
|
||||
Initialise(Visited, North_Walls, East_Walls)
|
||||
Generate_Maze(Visited, North_Walls, East_Walls)
|
||||
Draw_Maze(North_Walls, East_Walls)
|
||||
|
|
@ -1,37 +1,33 @@
|
|||
H ← 8
|
||||
W ← 18
|
||||
Ver ← 0
|
||||
Hor ← 1
|
||||
Vis ← 2
|
||||
# Build and solve a maze.
|
||||
# Experimental!
|
||||
W ← 10
|
||||
H ← 6
|
||||
|
||||
BreakNS ← ⊂Ver⊂⊃(/↥≡⊡0|⊡0_1)
|
||||
BreakEW ← ⊂Hor⊂⊃(⊡0_0|/↥≡⊡1)
|
||||
GetWall ← -:⊡1:÷2/-.
|
||||
# ([here, next], maze) -> (maze')
|
||||
BreakWall ← ⍜⊡(0◌)⟨BreakNS|BreakEW⟩=°⊟≡⊢.
|
||||
BreakWall ← ⍜(⊡|⋅@ )GetWall
|
||||
|
||||
Neighbours ← +⊙¤[[¯1 0] [1 0] [0 1] [0 ¯1]] # Gives N4
|
||||
Nfour ← +⊙¤[¯2_0 2_0 0_2 0_¯2] # Gives N4
|
||||
Shuffle ← ⊏⍏[⍥⚂]⧻.
|
||||
IsVisited ← ¬⊡⊂Vis
|
||||
MarkAsVisited ← ⟜(⍜(⊡|1◌)⊂Vis)
|
||||
OnlyInBounds ← ▽≡IsVisited ⊙¤,, # (finds the boundary 1's)
|
||||
|
||||
# (pos maze) -> T if it's already a star.
|
||||
IsVisited ← ≠@.⊡
|
||||
MarkAsVisited ← ⟜(⍜⊡⋅@.)
|
||||
# (pos) -> (bool)
|
||||
InBounds ← ▽⊸≡(↧⊃(/↧≥1_1|/↧< +1 × 2 H_W))
|
||||
# (here, maze) -> (maze')
|
||||
Walk ← |2 (
|
||||
MarkAsVisited
|
||||
# (here, maze) -> ([[here, next] x(up to)4], maze)
|
||||
≡⊟¤⟜(Shuffle OnlyInBounds Neighbours)
|
||||
≡⊟¤⟜(Shuffle InBounds Nfour)
|
||||
|
||||
# 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◌°⊟,,)
|
||||
)
|
||||
|
||||
⊂↯H⊂↯W0 1↯+1W1 # vis (added 1's help bounds checks)
|
||||
⊂↯H⊂↯W1 1↯+1W 0 # ver
|
||||
↯+1H⊂↯W1 0 # hor
|
||||
⊂⊟
|
||||
# Stack: ([hor, ver, vis])
|
||||
Walk [0 0]
|
||||
|
||||
PP! ← ≡/⊂∵^! # Pretty print using switch.
|
||||
≡(&p$"_\n_")⊃(PP!⟨"+ "|"+--"⟩⊡Ver|PP!⟨" "|"| "⟩⊡Hor)
|
||||
# Generate a maze.
|
||||
Maze ← (
|
||||
↘¯1☇1↯(+1H)⊟⊂/⊂↯W"+-" @+⊂/⊂↯W"| " @| # Build a filled maze.
|
||||
Walk 1_1 # Walk around breaking walls.
|
||||
)
|
||||
Maze
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue