What's the shortest path from A to R in the array below, if your moves are to be in the repeated length sequence 3, 2, 1, 3, 2, 1... (such as, say ADJMC...), and no two successive moves are in the same direction or in the reverse direction? Moves may be orthogonal or diagonal. No move may end on a hyphen (-) but may jump over them and the R must be reached on exact count.
ABCD-
EFGH-
--IJK
-LM-N
OP-QR
Since it seems that hyphens are jumped OVER, they presumably do not count toward the number-length of a sequence.
Doesn't starting from A, and then diagonally F I (-) R gets from A to R on an exact count of three? -- hence the shortest path?? I assume this is one "move". The R is reached on the exact count of 3 (the requirement for the first move).
(If NOT the answer, what have I misinterpreted?)
Hoping or Hopping Hopefully
