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?
As shown in the image, the nine Dogs are square fenced. By constructing just two square fences can you make sure that two Dogs cannot meet each other without crossing the fence?