All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
Jump, Skip and Hop (Posted on 2010-11-03) Difficulty: 3 of 5
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

See The Solution Submitted by Charlie    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Hoping or Hopping Hopefully | Comment 2 of 6 |
(In reply to Hoping or Hopping Hopefully by ed bottemiller)

The positions of the hyphens count in the length of the move. Their identification as hyphens merely prevents landing there; it does not mean that hyperspace allows warping through the occupied area.
  Posted by Charlie on 2010-11-03 16:33:17

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information