Enter a keyword into the search box. The riddle search will check to see if the word is in the Title, Riddle, or Answer and return results if they exist.
"3" Riddles - Next 10 of 3600.
Riddle:
There were 2 doors, one was stuffed with treasure meanwhile the other had a pit to nowhere. Behind each door was a guard, one guard always told the truth while the other guard always told a lie. However you do not know which guard was on which door. You could only ask one question to any of the guards to figure out which one has the treasure. What might you ask to find out where the treasure is?
Answer: Go up to one of the guards and ask this question, " Hello, which door that your brother will point if I ask him which way is the heaven." Then take the other door. Don't enter the door that he was pointing. This question will work for both of them because if you ask this question to the truth guy, he will point the hell because he knows that the other guard will point hell and if you asked to the liar, he'll still point hell because he knows that the other guard will point to heaven door, so he lied. That's why you take the other door.
Riddle:
A man goes into a diner. The man orders a plate, a match, a lemon wedge, and a glass of water. The waiter comes back with the mans bizzare order. The man dumps the water on the plate, and leaves the lemon wedge and match aside. "If you can get the water into the glass without touching the plate , I will give you $100." says the man. The waiter walked out $100 richer that night, how? (Hint : The $100 wasnt in tips.)
Answer: The riddle "Bizzare Order" is unanswered. Do you know the answer? If so, click and add your answer in the comments section.
Riddle:
Which weighs more, 1000 pounds of feathers or 1000 pounds of bricks? (You think you know it but you don't)
Answer: The feathers, you have to carry the weight of what you did to all those poor birds :(
Riddle:
Place three piles of matches on a table, one with 11 matches, the second with 7, and the third with 6. You are to move matches so that each pile holds 8 matches. You may add to any pile only as many matches as it already contains. All the matches must come from one other pile. For example, if a pile holds 6 matches, you may add 6 to it, no more or less.
You have three moves. How can you do it?
Answer: First pile to second; second to third; third to first:
| Pile | Initial number | First move | Second move | Third move |
| First | 11 | 11-7=4 | 4 | 4+4=8 |
| Second | 7 | 7+7=14 | 14-6=8 | 8 |
| Third | 6 | 6 | 6+6=12 | 12-4=8 |
Riddle:
Sometimes it's god, sometimes it's human, sometimes it's just an entity and in the end it's always just 1 person. Who is it?
Answer: The riddle "FIGURE THIS OUT if you can" is unanswered. Do you know the answer? If so, click and add your answer in the comments section.
Riddle:
A man walks into a bar and buys 4 kegs of beer for 20 dollars. He leaves the bar without spending a single penny, how did he do this?
Answer: He paid a 20 dollar bill.
Riddle:
When is homework not homework?
Answer: When it’s turned into the teacher.
Riddle:
What does not belong to the group; slow, glow, grow, throw, and/or blow?
Answer: / (because all the others are words)
Riddle:
If a bee lands in the palm of your hand, what is in your eye?
Answer: Beauty, because beauty is in the eye of the bee-holder!
Riddle:
You have 52 playing cards, 26 red, and 26 black. You draw cards one by one. A red card pays you a dollar. A black one fines you a dollar. You can stop any time you want. Cards are not returned to the deck after being drawn. What is the optimal stopping rule in terms of maximizing your expected payoff? Also, what is the expected payoff following this optimal rule?
Answer: The solution to this problem is, in my opinion the most difficult to understand of all the puzzles. Indeed I was unable to solve it and didn't receive a complete solution until two years after originally posting it. The final solution, in the form of the spreadsheet was sent to me by Han Zheng. For this reason I have left on the page the thoughts i had before I had the final solution as they represent an easier to understand and more simplistic approach. Also the reasoning may help you arrive at the final solution by yourself or help you understand it. I would recommend reading that answer before you dive into the full answer. But an important thing to note are that as the player we can't lose this game as we can gamble till all the cards are drawn and our net position is zero. From our earlier analysis it is clear we need a dynamic quit rule. A singal value is not sufficent. We must, at each stage consider what cards are remaining, and therefor the probability of a positive or negative outcome from drawing again. For the explanation i will ask you first to consider a deck containing only 6 cards, 3 +ve & 3 -ve (note i'm no longer calling the cards black and red, it confuses me.)
