The solution is X-e, C-nws, X-enw.
|
Here, we could solve the problem in one move if C weren't
in the way! So the point of the problem is to get C out of the path
of X getting to the center without moving A, B, or D, which are all
necessary for X to get to the center. The only solution to this
riddle is to move X first, then to have C clear the way by running into X
from the north.
The solution is X-e, C-nws, X-enw. |
This is a more traditional problem of this genre (at least among those that I've seen).
 |
We need to get a robot onto one of the
blue squares, so that X will be able to run toward it from the center row
or column and stop in the center square. Since X is not currently in
the center row or column, we will also need a robot in a red square so
that X will be able to move to the blue square opposite the one where the
other robot is so that X can then move to the center.
The first of these goals can be achieved by either moving B or D toward X. So we'll also need a robot on the red square just below and to the right of A. If D were in the square below A, we could imagine a robot being able to stop on that square, so we'll have B be the square that moves to the blue dot. |
 |
This is
how the last move might look, then. X couldn't make that whole move at the end without a robot
where D used to be, so it is more likely that X moved west before D moved
north. B would have had to move south before that. Since this
is four of the five moves that we are allowed, we'd better be close...
... and fortunately, we are. The ? could be A that bounced off of E and B before getting to D as the fourth move. The solution is B-s, X-w, D-n, A-esw, X-ne. |
Notes: These are the problems where I spent the waning moments of the test. I got part 1 in about two minutes, and spent a while on part 2 before giving up. This was actually the last puzzle that I solved out of the set.