Grid reachability for a robot that cannot reverse
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.
AmazonTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.