← Questions
Grid reachability for a robot that cannot reverse
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A robot moves on a grid of open cells, blocked cells, a start S and a destination D. It always faces one of four directions, can never turn around, and may only turn in the ways the rules allow. Decide whether it can reach D.
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