I was watching a movie and an older riddle popped up and it got me thinking "we don't see that question in newer movies at all anymore" and then I remembered several others you never see so I thought of making a thread for solving crazy riddles and logic problems.
So, without further notice:
1. You stand in front of two doors. Each door is guarded by a soldier. One door leads to great things, other to certain death and you don't know which is which. You are allowed to ask one guardian at choice one single question. One guardian always tells the truth, and one always lies, but you don't know which is which, what is the question you ask?
_______________________________________
2. You enter a maze, there is an exit on the other side of it, how do you get to it? (there are no traps, just an endless maze with only one exit on the other side)
______________________________________
3 A rooster has made two eggs: o O (these are the actual eggs, these two "o", which is bigger?)
______________________________________
4. Write something:
______________________________________
5. Which of these lines is the longest:
_____________
_____________
_____________
______________
Well... be free to resolve them, once someone gets a right answer, I'll say it (hopefully before more post).
And of course, feel free to add your riddles, problems and whatnot so that others can solve
New added 08.06.2012
6.(thanks to Azlarn) I think I'll post a riddle I found a year ago or so. It's not really hard but it's kinda long:
A warden meets with 23 prisoners. He tells them the following:
Each prisoner will be placed into a room numbered 1-23. Each will be alone in the room, which will be soundproof, lightproof, etc. In other words, they will NOT be able to communicate with each other.
They will be allowed one planning session before they are taken to their rooms.
There is a special room, room 0. In this room are 2 switches, which can each be either UP or DOWN. They cannot be left in between, they are not linked in any way (so there are 4 possible states), and they are numbered 1 and 2. Their current positions are unknown.
One at a time, a prisoner will be brought into room 0. The prisoner MUST change one and only one switch. The prisoner is then returned to his cell.
At any time t, given some N>0, there exists a finite t_0 by which time every prisoner will have visited room 0 at least N times. (In other words, there is no fixed pattern to the order or frequency with which prisoners visit room 0, but at any given time, every prisoner is guaranteed to visit room 0 again. If you’re still confused by this statement, ignore it, and you should be ok).
At any time, any prisoner may declare that all 23 of them have been in room 0. If right, the prisoners go free. If wrong, they are all executed.
What initial strategy is 100% guaranteed to let all go free?
____________________________________
7. A mother has 3 daughters. Each of these 3 girls has 2 brothers, how many children does the mother have?
____________________________________