Long Riddles and Answers

 

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?


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?

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?

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.

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

Who hacked the system?

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?