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?
If the number is divided by 3, it gives the remainder of 1;
If the number is divided by 4, it gives the remainder of 2;
If the number is divided by 5, it gives the remainder of 3;
If the number is divided by 6, it gives the remainder of 4.
In a jungle where there are no street lights or any other artificial source of lights, I notice a black snake crossing the road.
How did I get sight of the snake?