Long ago I had a chess teacher from Leningrad who turned the board over so the playing surface couldn't be seen and he wanted me to tell him how many moves it takes a knight to go from h8 to a8. It was blindfold chess. After I thought about it a little while I told him 5 moves.
He said ok. Now tell me which squares u used to get there! I did.
Fun times.
Long ago I had a chess teacher from Leningrad who turned the board over so the playing surface couldn't be seen and he wanted me to tell him how many moves it takes a knight to go from h8 to a8. It was blindfold chess. After I thought about it a little while I told him 5 moves.
He said ok. Now tell me which squares u used to get there! I did.
Fun times.
I just tried it in my head now - how did you make it in 5 moves? lol I think someone miscounted or played an illegal move lol.
Long ago I had a chess teacher from Leningrad who turned the board over so the playing surface couldn't be seen and he wanted me to tell him how many moves it takes a knight to go from h8 to a8. It was blindfold chess. After I thought about it a little while I told him 5 moves.
He said ok. Now tell me which squares u used to get there! I did.
Fun times.
I just tried it in my head now - how did you make it in 5 moves? lol I think someone miscounted or played an illegal move lol.
nvm lol I did h8 to a1 which took 6 moves - h8 to a8 isn't as hard is it?
From h8 go to f7, d6, c8, b6, a8. Five moves. There r other routes of course. When he asked which squares I used it was just to make sure I wasn't guessing.
From h8 go to f7, d6, c8, b6, a8. Five moves. There r other routes of course. When he asked which squares I used it was just to make sure I wasn't guessing.
Cool; we chose the same route 
Funny that I mis-read the question at first and attempted h8 to a1 lol, That takes one move longer - at first I thought your question was a trick question at how to get it in 5 moves - it was then I realized my mistake 
Talking graph theory, we just need to find a Hamiltonian cycle in the Knight's graph of the chessboard. The only way to find that is brute force, but there is one.
Also, a knight can move to an adjacent square to where it is in 3 moves.
Talking graph theory, we just need to find a Hamiltonian cycle in the Knight's graph of the chessboard. The only way to find that is brute force, but there is one.
I came across the problem a few years back as a programming challenge but I remember brute-force as one of the most inefficient ways to solve the problem. Lots of more efficient ways to go about it.
Yes