OCD - Year 10: Emergency Escapades ?

[AdApt*]

Could someone post a solution for the timed OCD please?

I have a tiny brain and just need an example. Target is 25 seconds.

My current solution 244 seconds.

a:
if c == nothing:
step w
endif
if c == 1:
step n
endif
if c == 2:
step e
endif
if c == 3:
step s
endif
if c == 4:
step w
endif
jump a

[Slack Aliss]

I've managed 101s with this, however I'm working out how to get people to cross that little bridge at the beginning rather than going around:

a:
if c == nothing or
c == 4:
step w
endif
if c == 1:
step n
endif
if c == 2:
step e
endif
if c == 3:
step s
endif
if c == 4 and
n == nothing and
s != hole and
e != hole:
step n
step n
step n
step n
step n
step n
step w
endif
jump a

[The Renderer]

There is a thread right on the very first page of this forum with a solution. But if that is not enough for you, I have a 23s solution. Not elegant but it works:

-- 7 Billion Humans (2059) --
-- 10: Emergency Escapades --

if n == hole:
step s
jump a
else:
if s == wall:
step n
jump b
endif
endif
b:
a:
c:
if c != 1:
step w
else:
if w == hole:
step n
step w
step w
jump d
else:
step w
step w
jump e
endif
endif
jump c
e:
d:
step s
step s
step s
step w
step w
step w
step w
step w
step n
step n
step n
step n
step n
step n
step w

[Futae Yamagawa]

Not bad ....
Not bad at all.
Things don't need to always be elegant.

I bet you can do it even faaaster than that. :D

[AdApt*]

Thanks ppl.

[Cravus]

Sorry for the question, but it refers to year 10. What am I doing wrong?
All employees reach the exit, but the solution is not accepted.





-- 7 Billion Humans (2059) --
-- 10: Flucht-Polonaise --

a:
if w == datacube and
w != worker:
step w
jump b
else:
if w == datacube and
w == worker:
step e
else:
step w
endif
jump a
endif
b:
c:
if c == 1 and
n != worker:
step n
endif
if c == 2 and
e != worker:
step e
endif
if c == 3 and
s != worker:
step s
endif
if c == 4 and
w != worker:
step w
endif
jump c

[Futae Yamagawa]

Assumptions are dangerous.
11 workers reached the exit.
How many started?

Edit: Bossbot knows. There's no fooling him.

[AdApt*]

Originally posted by Cravus:

Sorry for the question, but it refers to year 10. What am I doing wrong?
All employees reach the exit, but the solution is not accepted.

Your answer:

Originally posted by MarvMarv:

cause only 11 employees reach their goal, one of them falls to his death at the starting zone ~30 sec (at 1x speed) after start

[Cravus]

Thank you! I have not seen anyone die before.

[javierlopez1994]

I'm pretty sure you're supposed to hardcode the path, use their starting enviroment (what they can see in every direction) to force everyone of them to go to a specific tile, from there you can just have them follow the optimal path. I have a time of 17s but i'm sure it can be easily shortened.

[cajuncook]

One small tip is that you can walk diagonally adjacent to holes (e.g. row two from the bottom can walk up left and down left across the un-datablocked bridge at the start).

[Freya]

Found a 17 second solution. Not very elegant, but its fast :P

B:
step W
if(C == 1)
{
	if(W != HOLE)
	{
		step W
		jump A		
	}
	else if(NW != HOLE)
	{
		step NW
		jump A
	}
	else if(SW != HOLE)
	{
		step SW
		jump A
	}
	else
	{
		step N	
		step NW
		jump A
	}
	
}
jump B
A:
step SW
step S
step SW
step W
step W
step W
step NW
step N
step N
step N
step N
step NW

[Alexis Lestrange]

@Freya
I found your solution to be broken. A couple of people are 2 squares away from the bridge.

I placed 2 x 'step W' at the start of the code. Under the check for SW, I added another nested if with a check for the wall. ITT looks like people aren't placing their curly brackets/endifs 100% in the right place. (I know this isn't exactly real code, but adding tabs instead of spaces breaks syntax, meaning your code will not work)

step W
step W
B:
step W
if(C == 1) {
    if(W != HOLE) {
        step W
        jump A
    }
    else {
        if(NW != HOLE) {
            step NW
            jump A
	}
        else {
            if(SW != HOLE) {
                if(SW != WALL) {
                    step SW
                }
                else {
                    step N
                    step NW
                    jump A
                }
            }
        }
    }
}
jump B
A:
step SW
step S
step SW
step W
step W
step W
step NW
step N
step N
step N
step N
step NW

Hope this helps anyone who stumbles across this thread.

[Stinolez]

Ok, so I have 15s solution - here is the picture[share.stinolez.com].

[dmr]

Does anyone have a good method for pasting code from the iPad version yet? I’d like to submit my solutions on GitHub

[Krowi]

My 15 seconds solution:

-- 7 Billion Humans (2214M) --
-- 10: Emergency Escapades --

if s == wall:
	step nw
endif
step w
step w
step w
a:
if c != 1 and
 w != hole:
	step w
	jump a
endif
if w == hole and
 nw != hole:
	step nw
else:
	if w != hole:
		step w
	else:
		if w == hole and
		 sw != hole:
			step sw
		endif
	endif
endif
comment 0
step sw
step s
step sw
step w
step w
step w
step nw
step n
step n
step n
step n
step nw


DEFINE COMMENT 0
eJztjz9LgmEUxX9foyXMJQiMRBGH0AyRFwmDaIiGBocIsgIRIXyRMzSG0h8SIsJFcXCQanBujKY+ked9
6VvouRx47uGc+9xbwciSU5qstvzaJE+SshIckODYPNUGdW3TJUPPjhdlmJBmphRfSvLBOlPWrBk65Eg1
mtSYx32RKiUCzs2ov2SuBj3dcCG71KKiNvvc2tehTkhXIePIyxXStZW2K8res2cGPHCnJ2axp0+gvvVH
8nr2dgPfMaTAiKrGnJhnGnnuK00NvNcbLYaEmvAe57/Z5ef/v08K+nX+jx1WWGFJsABn+0NO;