As shown in the picture below, we can see a boy hanging on the tree branch to save his life. There are various ways in which he can die like1. A snake hanging toward the right waiting to bite the boy.2. A roaring Lion near the tree.3. Two crocodiles are ready to attack if the boy reaches near water. The tree is chopped to some extent, so can fall as if he moves a lot. Can you give this boy an escape plan?
Before the start of the car race, John and Jacob have the same amount of fuel in their car. With this fuel, John can drive for 4 hours while Jacob can drive five hours.
After a time they realize that the amount of fuel left in John's car is 1/4th of the fuel in Jacob's.
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?
A hen, a dog, and a cat are stolen. Three suspects are arrested named Robin, Steve, and Tim. The police are sure that all of them stole one of the animals but they don't know who stole which animal.
Sherlock Holmes is appointed to identify and is provided with the following statements from the investigation.
Robin - Tim stole the hen
Steve - Tim stole the dog
Tim - Both Robin and Steve are lying. I neither stole a hen nor a dog.
Sherlock is somehow able to deduce that the man who stole the cat is telling a lie and the man who stole the hen is telling truth.
Two prisoners Jack and Jill are locked in a cell.
There is open window approx 40 feet above the ground of the cell.
They are never able to reach there.
Then they plan to escape by a tunnel and they start digging out.
After digging for more than 20 days, Jill comes with the different plan and they escaped.
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
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.