Author Topic: Origonal riddles| Share and solve  (Read 36709 times)

you can have poop, but no toilet
« Last Edit: September 28, 2008, 08:06:14 PM by TapeDeck »

You need to say both what you can have and can't have, forgot to mention that. :3
« Last Edit: September 28, 2008, 08:08:31 PM by Xoax »


Here is mine:

A guy walks into a bar and asks the bartender for a glass of water. The bartender instead points a gun at the guy's head. The guy shakes his hand a leaves. What happened?

-snip-
Now many prisoners are there, and of so, are there any other rules on conduct inside said room and solitary.

You can have sound but no music...?



You can have sound but no music...?
You can't have sound, you can't have music.

Now many prisoners are there, and of so, are there any other rules on conduct inside said room and solitary.
The number of prisoners doesn't matter, and I suppose there aren't any rules other than what's stated in the riddle.

The governor of a prison is bored. He decides to amuse himself by playing
a game with the prisoners. He sets up a room with two switches in it. Each
switch has 2 positions (on and off ). He tells the prisoners that he is going to
send them to the room one at a time and that they have to move exactly one
of the switches each time they visit. He is free to send them in whatever order
he likes and can send them as often as he likes (perhaps sending one prisoner
100 times before sending some other prisoner, then sending the first one again...
anything!). The only promise that he makes is that if any prisoner picks a
number n and waits long enough, they can be sure to visit the room n times.
The prisoners are kept in solitary and are unable to communicate once the
game has started. They will never know how many other prisoners have visited
the room since they were last there. They are also not told what the initial
position of the switches was.
The governor tells them that if at any stage a prisoner comes to him and
states correctly that all prisoners have now visited the room at least once, all of
the prisoners will be freed. But if a false claim is made, they will all be shot.
The night before the game begins the prisoners meet in a large room to
discuss their tactics. Do they have a strategy that ensures they will win their
freedom?
Easy. One prisoner is designated as the "caller." He and only he will make the determination of when everyone's been in the room. Whenever he sees that the left-hand switch is "down," he will move it "up" and add 1 to his count; otherwise, he will flip the right-hand switch and not think anything of it. When the other prisoners enter the room, they have a different strategy. If the left-hand switch is "up," they will switch it "down," but they will only do this the first two times they encounter the left-hand switch "up." If they've moved the left switch twice already, or if the left-hand switch is "down," they will flip the right-hand switch.

When the caller's count is twice the number of prisoners plus one, each prisoner must have been in the room at least once, regardless of the initial configuration of the switches.

None have yet to answer "what bell do you ring that you never intend to hear?"

Another hint, you intend for others to hear it.
Death Knell?

Someone already got the right answer of "phone".

Oh, lol. Death knell could have been a potential answer though.

  34589
-  1256
-------------
  33333
Wrong. You used 5 twice and didn't use 7.

The question:

Use each of the numbers one through nine exactly once to fill in the blanks and complete this equation.

     ~~~~~
 -     ~~~~
-----------------
       33333