Riddles about people

logicsimpleclean

Allan, Bertrand, and Cecil were caught stealing so the king sent them to the dungeon. But the king decided to give them a chance. He mad them stand in a line and put hats on their heads. He told them that if they answer a riddle, they could go free. Here is the riddle: "Each of you has a hat on your head. You do not know the color of the hat on your own head. If one of you can guess the color of the hat on your head, I will let you free. But before you answer you must keep standing in this line. You cannot turn around. Here are my only hints: there are only black and white hats. At least one hat is black. At least one hat is white." Allan couldn't see any hats. Bertrand could see Allan's hat but not his own. Cecil could see Bertrand's hat and Allan's hat, but not his own. After a minute nobody had solved the riddle. But then a short while later, one of them solved the riddle. Who was is and how did he know?
Bertrand knew the answer because Cecil didn't say anything after one minute. If Bertrand and Allan's hats were both the same color, then Cecil would know what color his hat was. But Cecil didn't know. So Bertrand knew that Allan's hat was a different color than his. Since Allan's hat was black, Betrand knew his hat was white.
76.44 %
92 votes
logic

If you were running a race, and you passed the person in 2nd place, what place would you be in now?
You would be in 2nd. Well, you passed the person in second place, not first.
75.38 %
83 votes
logiccleanclevermath

At a dinner party, many of the guests exchange greetings by shaking hands with each other while they wait for the host to finish cooking. After all this handshaking, the host, who didn't take part in or see any of the handshaking, gets everybody's attention and says: "I know for a fact that at least two people at this party shook the same number of other people's hands." How could the host know this? Note that nobody shakes his or her own hand.
Assume there are N people at the party. Note that the least number of people that someone could shake hands with is 0, and the most someone could shake hands with is N-1 (which would mean that they shook hands with every other person). Now, if everyone at the party really were to have shaken hands with a different number of people, then that means somone must have shaken hands with 0 people, someone must have shaken hands with 1 person, and so on, all the way up to someone who must have shaken hands with N-1 people. This is the only possible scenario, since there are N people at the party and N different numbers of possible people to shake hands with (all the numbers between 0 and N-1 inclusive). But this situation isn't possible, because there can't be both a person who shook hands with 0 people (call him Person 0) and a person who shook hands with N-1 people (call him Person N-1). This is because Person 0 shook hands with nobody (and thus didn't shake hands with Person N-1), but Person N-1 shook hands with everybody (and thus did shake hands with Person 0). This is clearly a contradiction, and thus two of the people at the party must have shaken hands with the same number of people. Pretend there were only 2 guests at the party. Then try 3, and 4, and so on. This should help you think about the problem. Search: Pigeonhole principle
74.78 %
57 votes
cleanfunny

What can you lose that will cause other people to lose theirs too?
Your temper.
74.40 %
75 votes
simplelogictricky

You see a boat filled with people. It has not sunk, but when you look again you don't see a single person on the boat. Why?
All the people were married.
74.21 %
79 votes
logiccleverclean

Four people come to an old bridge in the middle of the night. The bridge is rickety and can only support 2 people at a time. The people have one flashlight, which needs to be held by any group crossing the bridge because of how dark it is. Each person can cross the bridge at a different rate: one person takes 1 minute, one person takes 2 minutes, one takes 5 minutes, and the one person takes 10 minutes. If two people are crossing the bridge together, it will take both of them the time that it takes the slower person to cross. Unfortunately, there are only 17 minutes worth of batteries left in the flashlight. How can the four travellers cross the bridge before time runs out?
The two keys here are: You want the two slowest people to cross together to consolidate their slow crossing times. You want to make sure the faster people are set up in order to bring the flashlight back quickly after the slow people cross. So the order is: 1-minute and 2-minute cross (2 minute elapsed) 1-minute comes back (3 minutes elapsed) 5-minute and 10-minute cross (13 minutes elapsed) 2-minute comes back (15 minutes elapsed) 1-minute and 2-minute cross (17 minutes elapsed)
73.90 %
78 votes
simplecleanlogic

Our dinner guests cry that we are evil, when they notice their place in the meal. But its no big deal why; we are just one big happy tribe! And we get really fed up with people! Who, What or Are we?
Cannibals
73.56 %
40 votes
simpleclean

There are 20 people in an empty, square room. Each person has full sight of the entire room and everyone in it without turning his head or body, or moving in any way (other than the eyes). Where can you place an apple so that all but one person can see it?
Place the apple on one person's head.
73.05 %
71 votes
12
MORE RIDDLES >
Page 1 of 2.