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?
One of the leprechaun is missing if you see the two pictures attached to this question. Where did he go? When he comes back, do you know where has he been?