Knight Jumping to Each Square Once

If anyone has ever played this little game and completed it successfully, would you please post your path here?

The link to the game, in case you haven't heard of it before, is:

http://www.yukyuk.com/games_downloads/online_chess/knight_game/knight_game.shtml

My best is 62 of the squares... so close yet so far...

oh, i get it, just tryin to land on all the squares, and you can land on one square more than once...

84 first try =( - though I wasn't sure what i was doing

74 second try - though I didn't land on one square ?

Originally posted by Drew L
oh, i get it, just tryin to land on all the squares, and you can land on one square more than once...

84 first try =( - though I wasn't sure what i was doing

74 second try - though I didn't land on one square ?

Lol, how do you get more than 64 when there are only 64 squares on the board? 😛

Originally posted by wittywonka
Lol, how do you get more than 64 when there are only 64 squares on the board? 😛

Because the program counts the number of moves you need to touch all of te squares, you are allowed to jump again on squares which you allready used.

72 first try. Then I got bored

My my my I wish I'd gotten a screenshot of the squares I did its fairly easy if you know how. http://www.borderschess.org/KnightTour.htm

73...arrghh

Open Trajectory:

a1-c2-e1-g2-h4-g6-h8-f7-d8-b7-a5-b3-c1-e2-g1-h3-
-g5-h7-f8-d7-b8-a6-b4-a2-c3-d5-f6-e4-c5-e6-f4-d3-
-f2-h1-g3-h5-g7-e8-c7-a8-b6-a4-b2-d1-e3-c4-d6-f5-
-d4-c6-e5-f3-h2-g4-h6-g8-e7-c8-a7-b5-a3-b1-d2-f1.

Start only in a1 or f1.

Closed Trajectory:

a1-c2-a3-b1-d2-c4-a5-b7-d8-c6-e5-d7-b8-a6-c5-a4-
-b2-d1-c3-e4-g5-h7-f6-h5-g7-e6-f8-g6-h8-f7-h6-g8-
-e7-d5-b6-a8-c7-e8-d6-c8-a7-b5-d4-f3-e1-g2-h4-f5-
-e3-f1-h2-g4-f2-h1-g3-e2-g1-h3-f4-d3-b4-a2-c1-b3.

Start where you want.

Find Leonhard Euler.

Originally posted by Helder Octavio
[b]Open Trajectory:

a1-c2-e1-g2-h4-g6-h8-f7-d8-b7-a5-b3-c1-e2-g1-h3-
-g5-h7-f8-d7-b8-a6-b4-a2-c3-d5-f6-e4-c5-e6-f4-d3-
-f2-h1-g3-h5-g7-e8-c7-a8-b6-a4-b2-d1-e3-c4-d6-f5-
-d4-c6-e5-f3-h2-g4-h6-g8-e7-c8-a7-b5-a3-b1-d2-f1.

Start only in a1 or f1.

Closed Trajectory:

a1-c2-a3-b1-d2-c4-a5-b7-d8-c6-e5-d7-b8-a6-c5-a4-
-b2-d1-c ...[text shortened]... -g4-f2-h1-g3-e2-g1-h3-f4-d3-b4-a2-c1-b3.

Start where you want.

Find Leonhard Euler.[/b]

I used to have 2 routs memorized 2 or so years ago, and used one of them as an avatar. I'll need to see if I can find that image from the office Monday or so.

This is a great little challenge to show a friend when you meet them for some OTB.

P-

I did 71 and 70 on my first two tries. Then I threw in the towel and learned the opensolution that was posted above (in the link provided by zoot). I think it would be more worthwhile to learn the closed solution, because then you could do it from any start square. That would be much more impressive to show off!

69 on my first try. Amusing puzzle however
72 on my second, I got worse 🙁

Originally posted by zebano
69 on my first try. Amusing puzzle however
72 on my second, I got worse 🙁

lol neat.. i did it in 69 too .. that's tough.

George Koltanowski, did his "Knights Tour" Blindfolded, that is on a large Chess board he would write in various names, i.e. a1=Spassky b3=Fischer a5= 8 diget number and so forth. George would study the board for a few minutes and turn his back to the board and ask a viewer to place the Knight anywhere on the board, again without looking George would recite what was on the square and where the Knight should move too, reciting what was on that square, NEVER landing on the same square twice and remembering all that was placed on the board.. George was remarkable, as a chess player and Ambassdor to the Chess world.

I am officially the worst knight hopper in the land.

84-74-72

Posted by davutuysal on chess.com Start with any random square for the knight.Write down all possible 2nd moves.To choose the 2nd move,select the one that leads to a minimum count on the third move.Repeat until complete.

73-73-68-quit