There is something which you can be arrested for attempting but not for successfully completing.

As we know that white starts the game of chess. Can you find the scenario shown in the picture below is possible when all the white pieces are at the original place while the black pawn is not as in the below picture?

You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?

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?

Two-person want to cross a river. Only one boat is present on the riverside that can carry only one person at a time.

However, they still manage to cross the river. How is it possible?

Can you identify the famous TV character from the rebus below?

Identify the hidden meaning behind this picture?

A gardener planted the Lemon trees in a mathematical ordered way (i.e. he planted a tree in rows).
He created a total of 19 rows of trees.

Note: There should be more than 2 trees to count as a row.

What is the minimum number of trees required by the gardener to have 19 rows of trees?

Can you think of a smallest +ve number such that if we shuffle the digits of the number, the new number becomes double the original number?

Replace the question mark with the correct number, given the pair of numbers exhibits a similar relationship?

? : 3839 :: 11 : 1209