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
(In reply to
re: Some Thoughts by ed bottemiller)
Ah, very clever, Ed. I didn't catch that your 2nd post was a proposed solution. I just thought you were upset with Charlie. Nice work!
re(2): Some Thoughts
