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.
(In reply to
I, too, solved it :) by Dej Mar)
Dej Mar, may I rejoice with you. When Josie proposed this as a concept idea I looked to some degree at the numbers 1 to 5 for understanding of her proposition; might I say that you need to insert "3". Oh, and also checked somwwhat on her exit, but not as closely as I have suggested below.
May I take your opening sentence somewhat in the negative? By that I mean starting at 64 and going backwards. Clearly "63" has one placement only because it is not corrresponding to a coloured cell. There are 4 cells in which "62" can reside until one realises that "62" is not yellow.
I'm not going to follow this through as diagnostically nikki would do, but, one would have to "meet" somewhere in the middle.
Thanks for involving me Josie, and Brian Smith, I trust that my enhanced colourings suit your display; the update was probably an hour or two prior to publishing!
Edited on January 25, 2008, 8:23 am
|
|
Posted by brianjn
on 2008-01-25 08:21:19 |
re: I, too, solved it :)
