# The Grey Labyrinth is a collection of puzzles, riddles, mind games, paradoxes and other intellectually challenging diversions. Related topics: puzzle games, logic puzzles, lateral thinking puzzles, philosophy, mind benders, brain teasers, word problems, conundrums, 3d puzzles, spatial reasoning, intelligence tests, mathematical diversions, paradoxes, physics problems, reasoning, math, science.

Message body

 Emoticons View more Emoticons
 [quote="el_mago8*"]But ir the board has 64 squares, and I use 4 for the first move, and 3 on the following, that allows me only to do a maximum of 21 moves using all the squares in the board (because I cant land twice in the same one, or cross a square twice, isnīt it? So there has to be a solution using the 64 squares in 21 moves. So far, I have 20 moves. Please let me know if Im wrong[/quote]
Options
HTML is OFF
BBCode is ON
Smilies are ON
 Disable BBCode in this post Disable Smilies in this post

 All times are GMT
 Jump to: Select a forum Puzzles and Games----------------Grey Labyrinth PuzzlesVisitor Submitted PuzzlesVisitor GamesMafia Games Miscellaneous----------------Off-TopicVisitor Submitted NewsScience, Art, and CulturePoll Tournaments Administration----------------Grey Labyrinth NewsFeature Requests / Site Problems
 Topic review
Author Message
timr*
Posted: Mon Oct 02, 2006 11:23 am    Post subject: 1

35 is the best possible, I think. Starts d4-f5-g7-e6-.......
Sentran*
Posted: Fri Sep 29, 2006 4:55 pm    Post subject: 0

The correct answer is 35, but how you get to it is quite the puzzle.
m*
Posted: Fri Sep 29, 2006 11:21 am    Post subject: -1

33 squares, including the one he starts on?
G-man*
Posted: Tue Sep 26, 2006 2:32 am    Post subject: -2

Came up with 32 moves.. Could be improved though.. I guess.
Bates*
Posted: Wed Sep 20, 2006 11:33 pm    Post subject: -3

Sentran*
Posted: Tue Aug 22, 2006 8:58 pm    Post subject: -4

Sentran* wrote:
Again, I have managed 25 moves, but no more as yet. Has anyone done better than this?

Correction - 27 moves, and I can reproduce it.
Sentran*
Posted: Tue Aug 22, 2006 8:44 pm    Post subject: -5

Again, I have managed 25 moves, but no more as yet. Has anyone done better than this?
/dev/joe*
Posted: Tue Aug 22, 2006 8:36 pm    Post subject: -6

el_mago, the constraint is that the path does not cross, where the path is a straight (diagonal) line between the start and end of the move. So you could move from d3 to b2 to c4, and then after some other moves, move from c2 to a1 to b3. There is no requirement to set aside any particular squares as uncrossable due to a move, only the line of the move.
guest*
Posted: Sat Aug 19, 2006 2:25 am    Post subject: -7

Space can be used more effectively to allow more than 21 moves.
el_mago8*
Posted: Sat Aug 19, 2006 12:13 am    Post subject: -8

But ir the board has 64 squares, and I use 4 for the first move, and 3 on the following, that allows me only to do a maximum of 21 moves using all the squares in the board (because I cant land twice in the same one, or cross a square twice, isnīt it? So there has to be a solution using the 64 squares in 21 moves. So far, I have 20 moves. Please let me know if Im wrong
Sentran*
Posted: Fri Aug 18, 2006 5:51 pm    Post subject: -9

Thank you very much! I'm still trying to work out a good route to solve this...
el_mago8*
Posted: Fri Aug 18, 2006 5:51 pm    Post subject: -10

HI from Spain!!
I tried the knight thing, and although I dont understand it very well, I did 20 moves (21 would be the maximum, right?
Iīll post it as soon as I get back
Courk
Posted: Fri Aug 18, 2006 1:54 am    Post subject: -11

Allow me to hijack the thread for a moment: Welcome to the GL!
Sentran*
Posted: Fri Aug 18, 2006 12:18 am    Post subject: -12

matthewv* wrote:
not entirely. You should learn that certain places are better for starting. It is partly brute force I suppose but less than 100 trials is possible. (100 may be an extreme)

I would say 100 is extreme, since there are only 64 squares on a chessboard. I'm not an expert by any means, and I've only just found GL today, but I can only come up with 25 so far.
time*
Posted: Sat Apr 29, 2006 10:30 am    Post subject: -13

sofamatt* wrote:
My question distilled is: is it a brute force problem or an 'aha' problem. Since the answer in wiki (avoid viewing solution by suppressing images) includes comment 'prohibitively longer for n>=9' I assume it's brute force.

I wont say anything about this puzzle because I already know a answere from when I was studying chess, but this is not a brute force proublem at all and if Im correct you can actualy use math to get the answere
matthewv*
Posted: Mon Apr 24, 2006 11:55 pm    Post subject: -14

not entirely. You should learn that certain places are better for starting. It is partly brute force I suppose but less than 100 trials is possible. (100 may be an extreme)
sofamatt*
Posted: Mon Apr 24, 2006 9:14 pm    Post subject: -15

My question distilled is: is it a brute force problem or an 'aha' problem. Since the answer in wiki (avoid viewing solution by suppressing images) includes comment 'prohibitively longer for n>=9' I assume it's brute force.
CrystyB
Posted: Mon Apr 24, 2006 4:31 pm    Post subject: -16

Spoiler: http://en.wikipedia.org/wiki/Longest_uncrossed_knight's_path
sofamatt*
Posted: Sun Apr 23, 2006 5:37 am    Post subject: -17

This is my first go round on GL so please be kind. O.K., don't, but if this is way off I promise to shape up for future posts. But, I don't see how this isn't just a brute force puzzle. I'm not tip-top on the math, but I'm not sure there's a way to make an abstraction so there's a proof of the greatest number result. In other words, it reminds me of other NP-complete problems. So far I have 28, still hunting for better... But where's the catch? Just a matter of luck?
sofamatt*
Posted: Sun Apr 23, 2006 5:37 am    Post subject: -18

This is my first go round on GL so please be kind. O.K., don't, but if this is way off I promise to shape up for future posts. But, I don't see how this isn't just a brute force puzzle. I'm not tip-top on the math, but I'm not sure there's a way to make an abstraction so there's a proof of the greatest number result. In other words, it reminds me of other NP-complete problems. So far I have 28, still hunting for better... But where's the catch? Just a matter of luck?
MatthewV
Posted: Thu Apr 13, 2006 2:15 am    Post subject: -19