Jim and Sarah are in a long-distance relationship. Jim buys an engagement ring for Sarah and wants to mail it to her. Unfortunately, the only way to ensure the ring will be received is to place a lock on the package. Jim has locks and Sarah has locks, but neither has keys for each other’s locks. How can they make sure the ring isn’t stolen?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?