In the given picture, you can find two letters missing. When two particular letters are placed in the missing spots, you get an eight-letter word while reading in the anti-clockwise direction. Can you find out the missing letters and the missing word eventually?
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?
There was once a college that offered a class on probability applied to the real world. The class was relatively easy, but there was a catch. There were no homework assignments or tests, but there was a final exam that would have only one question on it. When everyone received the test paper it was a blank sheet of paper with a solitary question on it: 'What is the risk?'.Most students were able to pass, but only one student received 100% for the class! Even stranger was that he only wrote down one word!
What did he write?
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.
During an experiment, a guy throws a bouncy ball from a 100 feet tall building. The ball has a specific characteristic. Every time it hits the ground, it bounces up halfway.
How many bounces do you think the ball will make before it comes to a stop ?
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?