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:
Question: There is a farmer who has three sons. Nearing his death, he asked his three sons to find two objects that can fill the room he's in. The one who can deliver will be chosen as his heir. So the oldest son goes to the market to get hay while the middle son go get leaves. The youngest son goes to a shop and buys two things that he put in his pocket. The oldest son's hay only fills half the room, the middle son's leaves fills 2/4 quarters of the room, while the youngest fills the room with his two objects. Question: What are the two objects that the youngest son used to fill the room?
Answer: A match and a candle.