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.

See The Solution Submitted by Charlie    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(2): Some ThoughtsSteve Herman2010-11-03 22:43:54
re: Some Thoughtsed bottemiller2010-11-03 21:13:19
Some ThoughtsSome ThoughtsSteve Herman2010-11-03 20:54:41
re(2): Hoping or Hopping Hopefullyed bottemiller2010-11-03 17:16:30
re: Hoping or Hopping HopefullyCharlie2010-11-03 16:33:17
Hoping or Hopping Hopefullyed bottemiller2010-11-03 13:08:11
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information