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

Home > Logic
Colourful Knight's Tour (Posted on 2008-01-24) Difficulty: 3 of 5
A knight enters the grid at number 1 and then moves, as if he were on a chessboard, to number 2. He visits every square in numerical order, before exiting at number 64.

KEY:
Blue = cube numbers (1, 8, 27 and 64)
Green = squares which are not cubes (4, 9, 16, 25, 36 and 49)
Red = prime numbers (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59 and 61)
Yellow = multiples of ten (10, 20, 30, 40, 50 and 60)
Purple = multiples of 11 which are not prime (22, 33, 44 and 55)

One number has been added to get you started.

35

No Solution Yet Submitted by Josie Faulkner    
Rating: 4.9091 (11 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): I, too, solved it :) | Comment 13 of 19 |
(In reply to re: I, too, solved it :) by brianjn)

brianjn,

"3" was not inserted in the first grid as it could, without the more in-depth analysis needed, be located in E1 -or- E3.  Yet knowing it could be in either of those two squares, and that "4" must be in a green square, the placement of "4" in G2 was almost a no-brainer and I continued on with the 'two-or-three move look ahead' filling the squares...  Of course, with any new placements, I went back to those 'break points' to check, with the 'two-or-three move look ahead', to see if I could positively make any additional number placements. 

With the 'gift' number (35), it wasn't necessary to look ahead more than the two-or-three moves to determine what number placements to make.


  Posted by Dej Mar on 2008-01-25 12:10:07
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 (4)
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