Long Riddles and Answers

Show Description

Want to dive into our long riddles to test your problem solving skills. These lengthy puzzles test your ability to piece together information and find the answer.


72 ratings
11 saves

By Albert Einstein

Question: There are 5 houses painted 5 different colors. In each house lives a person with a different nationality. These 5 people each drink a certain type of beverage, smoke a certain brand of cigar, and keep a certain pet. None of them have the same pet, smoke the same brand of cigar, or drink the same beverage.

The Brit lives in the red house.
The Swede keeps dogs as pets.
The Dane drinks tea.
The green house is on the left of the white house.
The green homeowner drinks coffee.
The person who smokes Pall Mall rears birds.
The owner of the yellow house smokes Dunhill.
The man living in the center house drinks milk.
The Norwegian lives in the first house.
The man who smokes Blend lives next to the one who keeps cats.
The man who keeps the horse lives next to the man who smokes Dunhill.
The owner who smokes Bluemaster drinks beer.
The German smokes prince.
The Norwegian lives next to the blue house.
The man who smokes Blend has a neighbor who drinks water.

Who owns the fish?

Answer: The German. It's easiest to solve this riddle by creating a grid organized by order of the houses, you can then fill in the house number of the Norwegian, the person who drinks milk, and the blue house:

House #12345

These facts can all also be determined from the clues:

Brit - Red House
Swede - Dogs
Dane - Tea
Green House - Coffee
Pall Mall - Birds
Yellow House - Dunhill
Blue-masters - Beer
German - Prince
Green House is to left of the White House
Blends is next to Cats
Horse is next to Dunhill
Blends is next to Water

With this information these facts can be determined:

  1. House 3 cannot be green because whoever lives there drinks milk and not coffee.
  2. House 4 must be green since the green house needs a white house to its right.
  3. House one cannot be red because the Brit doesn't live there.

This info leads to a single color order:

House #12345

The following information can now be determined:

  1. The horse has to be at house 2 because it is next to the Dunhills.
  2. House 1 and 3 can't have birds, dogs, or Pall Malls.
  3. House 2 is where the Dane lives because of the horse.
  4. House 5 has the beer, Blue-masters, Swede, and dogs.
House #12345

With this version of the table we can now find the information pertaining to solving the riddle completely:

  1. House 3 has to have the Pall Mall and birds.
  2. Since blends must be next to cats blends must be at house 2 and cats at house 1.
  3. The Norwegian has the water.
  4. The German is the only one without a pet so his a the fish!
House #12345
SmokeDunhillBlendsPall MallPrinceBlue-masters


2 ratings
1 saves

Question: There is a kingdom and in the kingdom when you drink a poison the only way to cure yourself is to drink a stronger poison to neutralize it. The King wants to make the strongest poison possible in order to make sure he can neutralize any other poison he may be given. To do this he enlists the two best chemists of the land: Tom and Bob.

The king is going to have them both create a poison as strong as they can then have them drink the other person's poison then their own. Whoever dies created the weaker poison. Tom knows that Bob is much better at making poisons and he is sure to make a stronger poison. Knowing this, Tom makes a plan that ensures he lives and Bob dies.

The day of the contest arrives and Bob realizes that Tom must have known he had no chance against his prowess as a poison maker. So Bob thinks quickly and creates a new plan that ensures that once again he will live and Tom will die.

In the end Bob lives, Tom dies, and the King doesn't get what he wants.

What happened?

Answer: After Tom realized he was going to lose he finds that the only way to live is to replace his poison with something that isn't poison at all and drink a poison of his own before the contest. In this way he drinks his own weaker poison then neutralizes it with Bob's stronger poison. Last he drinks the non-poison he submitted to the contest.

Once Bob realizes that this is the only way Tom can save himself he figures out that he can save himself by either drinking a weaker poison before the contest so his neutralizes it in the contest or submit a non-poison to the contest as well. If he drinks a weaker poison before the contest both Tom and Bob will live and the King will realize that they are disobeying his orders which probably won't turn out well. But by submitting a non-poison to the contest as well Tom will end up drinking the weaker poison before the contest and the two non-poisons in the contest and he will still die, and the King will be none the wiser (although he will not get what he wants being that both of the poisons actually aren't poisons at all).


64 ratings
14 saves

Question: There is a prison with 100 prisoners, each in separate cells with no form of contact. There is an area in the prison with a single light bulb in it. Each day, the warden picks one of the prisoners at random, even if they have been picked before, and takes them out to the lobby. The prisoner will have the choice to flip the switch if they want. The light bulb starts off.

When a prisoner is taken into the area with the light bulb, he can also say "Every prisoner has been brought to the light bulb." If this is true all prisoners will go free. However, if a prisoner chooses to say this and it's wrong, all the prisoners will be executed. So a prisoner should only say this if he knows it is true for sure.

Before the first day of this process begins, all the prisoners are allowed to get together to discuss a strategy to eventually save themselves.

What strategy could they use to ensure they will go free?

Answer: Only allow one prisoner to turn the light bulb off and all of the others turn it on if they have never turned it on before. If they have turned it on before they do nothing. The prisoner that can turn it off then knows they have all been there and saves them all when he has turned it off 99 times.


35 ratings
10 saves

Question: A school's computer system was recently hacked and the school has narrowed the pool of possible hackers to 5 people that were in the computer lab: Tyler, Justin, Chandler, Paige, and Shelley. Each of them gave three statements, two of which are true and one false.

1. I didn't do it!
2. I've never hacked in my life.
3. Paige did it.
1. I didn't do it!
2. The attack was done from within the network.
3. I don't like Shelley.
1. I didn't do it!
2. I've never seen Shelley in my life.
3. Paige did it.
1. I didn't do it!
2. Shelley did it.
3. Tyler was lying when he said I did it.
1. I didn't do it!
2. Justin did it.
3. Chandler and I used to be friends.

Who hacked the system?

Answer: Justin did it.


0 ratings
0 saves

Question: A prison has 23 prisoners in 23 different cells. The prisoners have no way to communicate with each other in any way from their cells. There is another room, the rec room, that has two switches on the wall (A and B). The switches have on and off positions but they start in an unknown position.

Prisoners are randomly taken to and from the rec room one at a time. They must change the position of only one of the two switches each time they go to the room. At any point a prisoner can yell out, "Every prisoner has been here!" If the prisoner is correct that all of the prisoners have visited the rec room, then they all go free. If they aren't correct then they are all executed.

Before they start they are given one planning session during which they can discuss a method to win the game. What method can they use to ensure they all go free?

Answer: Here are the rules they can use to ensure they will all go free eventually:

The prisoners will choose one 'leader' and everybody else will be a follower. If you are a follower:

  • If switch A is in the on position, toggle switch B.
  • If switch A is off, you have not toggled switch A yet, and you have seen switch on during a previous visit; then toggle switch A. Otherwise toggle switch B.
If you are a leader:
  • If switch A is off, turn it on.
  • If switch A is on, turn it off. If you did not turn switch A on during their previous visit, increment the count of prisoners.
Once the leader increments the count to 23 they can yell, "Every prisoner has been here!" and all of them will be released.


Follow Us

Follow us and get the Riddle of the Day, Joke of the Day, and interesting updates.