This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 64: Binary Counter -- | |
if w == datacube: | |
comment 0 | |
step s | |
a: | |
listenfor go | |
step s | |
tell everyone ready |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 64: Binary Counter -- | |
step s | |
if s == button: | |
a: | |
step s | |
step n | |
tell w ok | |
listenfor ready |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 68: Goodbye, Humans! -- | |
if n == hole: | |
step ne | |
a: | |
if e != wall: | |
step e | |
jump a | |
endif |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 68: Goodbye, Humans! -- | |
a: | |
if e != hole: | |
step se | |
if sw == wall and | |
se == wall: | |
if nw != worker and | |
n != worker and |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 63: Defrag Disordered -- | |
if w != hole: | |
step n | |
step n | |
if ne == datacube: | |
pickup ne | |
else: | |
pickup n |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 63: Defrag Disordered -- | |
comment 1 | |
if w == worker: | |
step ne | |
step ne | |
pickup c | |
mem1 = set ne | |
step nw |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 59: Glory Hole -- | |
if ne == 6: | |
step e | |
endif | |
if n == 6: | |
a: | |
step nw | |
jump a |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 59: Glory Hole -- | |
a: | |
mem1 = foreachdir nw,w,sw,n,s,ne,e,se: | |
if c == 1: | |
mem2 = nearest hole | |
step mem2 | |
endif | |
if c == nothing or |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 58: Good Neighbors -- | |
mem1 = nearest wall | |
mem2 = nearest datacube | |
a: | |
b: | |
c: | |
d: | |
pickup mem2 |
This file contains hidden or 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
-- 7 Billion Humans (2087) -- | |
-- 58: Good Neighbors -- | |
a: | |
step nw,sw,ne,se | |
mem2 = set 0 | |
mem1 = foreachdir nw,w,sw,n,s,ne,e,se: | |
if mem1 == datacube: | |
mem2 = calc 1 + mem2 | |
endif |