-
Notifications
You must be signed in to change notification settings - Fork 52
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
5 changed files
with
65 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -8,3 +8,4 @@ Speedruns | |
Testing | ||
Vignettes | ||
Mechanics | ||
World Examples |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
clearing.yaml | ||
rorschach.yaml | ||
stretch.yaml |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
version: 1 | ||
name: Clearing | ||
description: | | ||
The base is in a clearing in the forest: the area within a certain | ||
radius of the base is completely clear of trees; then there are | ||
random trees at increasing density up to another radius; outside of | ||
the outer radius there are only trees. | ||
creative: true | ||
robots: | ||
- name: base | ||
display: | ||
char: Ω | ||
loc: [0, 0] | ||
dir: north | ||
world: | ||
dsl: | | ||
let trees = if (hash % 4 == 0) then {tree, dirt} else {dirt} | ||
in | ||
overlay | ||
[ {dirt} | ||
, mask ((x*x + 4*y*y) >= (6*6) && (x*x + 4*y*y) <= (30*30)) | ||
(let h = hash % 24 in if (36 + h*h) <= (x*x + 4*y*y) then {tree,dirt} else {dirt} ) | ||
, mask ((x*x + 4*y*y) > (30*30)) {tree, dirt} | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
version: 1 | ||
name: Rorschach | ||
description: | | ||
A world with both horizontal and vertical reflection symmetry, | ||
created with 'imap'. | ||
creative: true | ||
robots: | ||
- name: base | ||
dir: north | ||
loc: [0, 0] | ||
known: [tree] | ||
world: | ||
dsl: | | ||
let trees = if (hash % 4 == 0) then {tree, dirt} else {stone} | ||
in | ||
overlay | ||
[ mask (x >= 0 && y >= 0) trees | ||
, mask (x >= 0 && y < 0) (imap x (-y) trees) | ||
, mask (x < 0 && y >= 0) (imap (-x) y trees) | ||
, mask (x < 0 && y < 0) (imap (-x) (-y) trees) | ||
] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,16 @@ | ||
version: 1 | ||
name: Stretch | ||
description: | | ||
A world created by stretching a random pattern of trees, with the | ||
amount of stretching determined by the distance from the origin. | ||
creative: true | ||
robots: | ||
- name: base | ||
dir: north | ||
loc: [0, 0] | ||
known: [tree] | ||
world: | ||
dsl: | | ||
let trees = if (hash % 4 == 0) then {tree, dirt} else {stone} | ||
in | ||
imap (if (y == 0) then 0 else (x/abs(y))) (if (abs x <= 1) then 0 else (y/abs(x/2))) trees |