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?
Once upon a time, there was a castle on a square island. The entire island was surrounded by a 14m wide trench. The Romans had wanted to invade the castle and had brought a few wooden planks along with them to facilitate themselves in crossing the moat. The planks were however found to be only 13m long.
The Romans still managed to cross the trench. How did they do it?