A robot is placed on the square A1 of a standard chessboard and has to reach H8. It understands orders Up, Down, Left, Right. On some squares, there might be a cement block; is such a case, the robot does not execute the order and continues with the next one on your list.
There always is at least one possible path.
The list of directions is finite.
The robot might reach the destination somewhere in the middle of your list.
Give the answer in the form UURRU.
(This list will work i.e. on an empty 3x3 chessboard or with a single block on A3 but will fail with a single block on B3.)
Question
harey
A robot is placed on the square A1 of a standard chessboard and has to reach H8. It understands orders Up, Down, Left, Right. On some squares, there might be a cement block; is such a case, the robot does not execute the order and continues with the next one on your list.
There always is at least one possible path.
The list of directions is finite.
The robot might reach the destination somewhere in the middle of your list.
Give the answer in the form UURRU.
(This list will work i.e. on an empty 3x3 chessboard or with a single block on A3 but will fail with a single block on B3.)
Link to comment
Share on other sites
0 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.