Chocolate costs 6 rupees and a Toy costs 5 rupees. If you have 32 rupees in total, how many chocolates and how many Toys can be purchased with that amount?
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?
You have a square. What you have to do is cut and reassemble the square such that you create a Red Cross sign that has the same volume as that of the square.
A man died, leaving $10,000,000 for his widow, 5 sons and 4 daughters. Each daughter received an equal amount, each son received twice as much as a daughter, and the widow received three times as much as a son.
Seven Robbers robbed a bank and hide the coins in a lonely place.
They decide to divide the money equally the next morning. Two greedy robbers decided to cheat the others and reach the place at night. They equally divided the coins between them, one coin left. So they called another robber and then they decided to divide equally among the three. Sadly again one coin left. The same thing happened to the 4th 5th and the 6th robber.
However, when the 7th robber reached in the morning, they can divide the coins equally.
A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
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.