Posted October 18, 2020
Hello everyone!
Please can anyone explain, why this solution is failing?
The result looks correct to me...
Thanks in advance, g.
-- 7 Billion Humans (2144) --
-- 61: Kurzer Dienstweg --
a:
step nw,w,sw,ne,e,se
mem1 = nearest datacube
step mem1
if c == datacube and
c != 1:
pickup c
mem1 = set 99
mem2 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem2 < mem1:
mem1 = set mem2
endif
endfor
if mem1 != 99:
mem1 = calc mem1 + 1
write mem1
endif
drop
endif
jump a
Please can anyone explain, why this solution is failing?
The result looks correct to me...
Thanks in advance, g.
-- 7 Billion Humans (2144) --
-- 61: Kurzer Dienstweg --
a:
step nw,w,sw,ne,e,se
mem1 = nearest datacube
step mem1
if c == datacube and
c != 1:
pickup c
mem1 = set 99
mem2 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem2 < mem1:
mem1 = set mem2
endif
endfor
if mem1 != 99:
mem1 = calc mem1 + 1
write mem1
endif
drop
endif
jump a
