There are three boxes on a table. One of the box contains Gold and the other two are empty. A printed message contains in each box. One of the message is true and the other two are lies.
The first box says "The Gold is not here".
The Second box says "The Gold is not here".
The Third box says "The Gold is in the Second box".
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.
You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'
How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?
You are an expert on paranormal activity and have been hired to locate a spirit haunting an old resort hotel. Strong signs indicate that the spirit lies behind one of four doors. The inscriptions on each door read as follows:
Door A: It's behind B or C
Door B: Its behind A or D
Door C: It's in here
Door D: It's not in here
Your psychic powers have told you three of the inscriptions are false, and one is true. Behind which door will you find the spirit?
There is a barrel with no lid and some wine in it. 'This barrel of wine is more than half full,' said Curly. 'No it's not,' says Mo. 'It's less than half full.' Without any measuring implements and without removing any wine from the barrel, how can they easily determine who is correct?
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.
