← Questions
Blind maze escape: one command sequence for every start
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A robot is somewhere in a grid maze of walls (#), open cells (.) and an exit (E), but you do not know which open cell it starts on. It obeys the commands U, D, L and R, each moving it at most one cell. Find the shortest sequence of commands that brings the robot to the exit whatever cell it started from.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding