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?
While handling a project, the landscaper is asked by the owner of the mansion that he wants four trees in front of his mansion that are exactly equidistant from each other.
A man stands on one side of a river, his dog on the other. The man calls his dog, who immediately crosses the river without getting wet and without using a bridge or a boat. How did the dog do it?
You are a thief and you are being punished for your crime. People have tied your head down on a tree with a rope that has been anchored in the ground. A candle is burning below the rope which is slowly burning it away. Just below your head, a Lion has been left loose and is waiting for you to drop down on the ground so he can have you as his lunch.
You have to survive the scenario. How will you do it?
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.