Suppose that you are trapped on the surface of a frozen lake. The surface is so smooth and ideal that there is no friction at all. You cant make any grip on the ice and no wind is blowing to help you out. You have just a mobile phone with you which has got no reception disabling you to call for help.
How will you plan your escape before you freeze to death on the frozen lake?
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?
Suppose you are a girl candidate and sitting in an interview. Suddenly the interviewer asks you, 'What if one morning you wake up and find out that you are pregnant?
You are given 2 eggs.
You have access to a 100-storey building.
Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor, Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process
An exterior architect is asked by a builder to plant seven trees in a manner that there are exactly six rows of trees in a straight line and each row has three trees in particular.
In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?
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.