-- 7 Billion Humans (2144) --
-- Level 58: Good Neighbors --
-- Shortest Program: 10 Commands --
a:
step w,sw,n,ne,se
if c == 8:
pickup c
b:
if nw != wall and
ne != wall and
sw != wall and
se != wall or
c != nothing:
step w,n,s,e
jump b
endif
drop
mem1 = calc mem1 + 1
endif
if mem1 <= 3:
jump a
endif
Fastest Program
-- 7 Billion Humans (2144) --
-- Level 58: Good Neighbors --
-- Fastest Program: 120 Seconds --
mem1 = nearest datacube
a:
b:
step nw,w,sw,n,s,ne,e,se
if c != datacube or
c != 8:
jump b
endif
pickup c
mem2 = nearest wall
step mem2
c:
if nw != wall and
ne != wall and
sw != wall and
se != wall or
c != nothing:
step nw,w,sw,n,s,ne,e,se
jump c
endif
drop
step mem1
jump a