Problem Four: A Knight’s Tour
Oct 20th, 2006 by Percy
Start with a knight on any square on an 8 by 8 chess board. Keeping in mind the way a chess knight moves (two squares in any non-vertical direction and then one square in the perpendicular), find a series of moves such that the knight travels through every square only once.
I think I’ve heard about this problem before… Isn’t it called Hamilton’s route or something? I thought it was one of those really difficult things to do like that 8 queens problem…