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?
A man calls his dog from the opposite side of a river. The dog crosses the river without a bridge or a boat and manages to not get wet. How is this possible?