Three People In A Room
Three people enter a room and have a green or blue hat placed on their head. They cannot see their own hat, but can see the other hats.
The color of each hat is purely random. They could all be green, or blue, or any combination of green and blue.
They need to guess their own hat color by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $50,000 each, but if anyone guess incorrectly they all get nothing.
What is the best strategy?
The color of each hat is purely random. They could all be green, or blue, or any combination of green and blue.
They need to guess their own hat color by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $50,000 each, but if anyone guess incorrectly they all get nothing.
What is the best strategy?
Hint:
Simple strategy: Elect one person to be the guesser, the other two pass. The guesser chooses randomly 'green' or 'blue'. This gives them a 50% chance of winning.
Better strategy: If you see two blue or two green hats, then write down the opposite color, otherwise write down 'pass'.
It works like this ('-' means 'pass'):
Hats: GGG, Guess: BBB, Result: Lose
Hats: GGB, Guess: --B, Result: Win
Hats: GBG, Guess: -B-, Result: Win
Hats: GBB, Guess: G--, Result: Win
Hats: BGG, Guess: B--, Result: Win
Hats: BGB, Guess: -G-, Result: Win
Hats: BBG, Guess: --G, Result: Win
Hats: BBB, Guess: GGG, Result: Lose
Result: 75% chance of winning! Did you answer this riddle correctly?
YES NO
Better strategy: If you see two blue or two green hats, then write down the opposite color, otherwise write down 'pass'.
It works like this ('-' means 'pass'):
Hats: GGG, Guess: BBB, Result: Lose
Hats: GGB, Guess: --B, Result: Win
Hats: GBG, Guess: -B-, Result: Win
Hats: GBB, Guess: G--, Result: Win
Hats: BGG, Guess: B--, Result: Win
Hats: BGB, Guess: -G-, Result: Win
Hats: BBG, Guess: --G, Result: Win
Hats: BBB, Guess: GGG, Result: Lose
Result: 75% chance of winning! Did you answer this riddle correctly?
YES NO
Little Billy's Calculator
Little Billy has a calculator with 15 buttons. He has 10 keys for 0-9, a key for addition, multiplication, division, and subtraction. Finally, he has an = sign. However, Mark the Meanie messed up the programming on Billy's calculator. Now, whenever Billy presses any of the number keys, it comes up with a random single-digit number. The same goes for the four operations keys (+,-,x, /). So whenever Billy tries to press the + button, the calculator chooses randomly between addition, multiplication, subtraction, and division. The only key left untouched was the = sign.
Now, if Billy were to press one number key, one operation key, then another number key, then the = button, what are the chances the answer comes out to 6?
Now, if Billy were to press one number key, one operation key, then another number key, then the = button, what are the chances the answer comes out to 6?
Hint: Think about how many ways he could possibly get 6.
There is a 4% chance.
There are 16 possible ways to get 6.
0+6
1+5
2+4
3+3
6+0
5+1
4+2
9-3
8-2
7-1
6-0
1x6
2x3
6x1
3x2
6/1
There are 400 possible button combinations.
When Billy presses any number key, there are 10 possibilities; when he presses any operation key, there are 4 possibilities.
10(1st#)x4(Operation)x10(2nd#)=400
16 working combinations/400 possible combinations= .04 or 4% Did you answer this riddle correctly?
YES NO
There are 16 possible ways to get 6.
0+6
1+5
2+4
3+3
6+0
5+1
4+2
9-3
8-2
7-1
6-0
1x6
2x3
6x1
3x2
6/1
There are 400 possible button combinations.
When Billy presses any number key, there are 10 possibilities; when he presses any operation key, there are 4 possibilities.
10(1st#)x4(Operation)x10(2nd#)=400
16 working combinations/400 possible combinations= .04 or 4% Did you answer this riddle correctly?
YES NO
The Secret Santa Exchange
A group of ten friends decide to exchange gifts as secret Santas. Each person writes his or her name on a piece of paper and puts it in a hat. Then each person randomly draws a name from the hat to determine who has him as his or her secret Santa. The secret Santa then makes a gift for the person whose name he drew.
When it's time to exchange presents, each person walks over to the person he made the gift for and holds his or her left hand in his right hand.
What is the probability that the 10 friends holding hands form a single continuous circle?
When it's time to exchange presents, each person walks over to the person he made the gift for and holds his or her left hand in his right hand.
What is the probability that the 10 friends holding hands form a single continuous circle?
Hint: It's not as difficult as it seems.
It's the number of ways the friends can form a circle divided by the number of ways the names can be drawn out of the hat.
1/10
For a group of n friends, there are n! (n factorial) ways to draw the names out of the hat. Since a circle does not have a beginning and end, choose one person as the beginning and end of the circle. There are now (n-1)! ways to distribute the remaining people around the circle. Thus the probability of forming a single circle is
(n-1)! / n!
Since n! = (n-1)! * n (for n > 1), this can be rewritten as
(n-1)! / (n*(n-1)!)
Factoring out the (n-1)! from the numerator and denominator leaves
1/n
as the probability. Did you answer this riddle correctly?
YES NO
For a group of n friends, there are n! (n factorial) ways to draw the names out of the hat. Since a circle does not have a beginning and end, choose one person as the beginning and end of the circle. There are now (n-1)! ways to distribute the remaining people around the circle. Thus the probability of forming a single circle is
(n-1)! / n!
Since n! = (n-1)! * n (for n > 1), this can be rewritten as
(n-1)! / (n*(n-1)!)
Factoring out the (n-1)! from the numerator and denominator leaves
1/n
as the probability. Did you answer this riddle correctly?
YES NO
A Thought In Your Mind
I can bring a smile to your face, a tear to your eye or even a thought to your mind, but I can't be seen. What Am I?
Hint:
Bringing Back The Lost
It brings back the lost as though never gone, shines laughter and tears with light long since shone,
a moment to make, a life time to shed, valued then but lost when your dead. What is it?
a moment to make, a life time to shed, valued then but lost when your dead. What is it?
Hint:
A Memory Saved Forever
The memory is saved forever
however fire can end its life.
Its been around for awhile
and will never go out of style.
Its a?
however fire can end its life.
Its been around for awhile
and will never go out of style.
Its a?
Hint:
Does Not Break
Hint:
A Chaotic Outsider
Hint:
Kindness And Cruelty
Capable of Kindness and cruelty, I take victims when I sour. I can be on your side or wrong you. I bring gifts though you already have me. What am I?
Hint:
Standing My Test
I'm seen to fly, described as hard. I can be your currency and heal all wounds, but not many things can stand my test. I am...
Hint:
A Town With No Houses
Hint:
Something I Seek
There is something I seek.
While it is bound, it chooses kings and peasants.
When it is freed, it foretells war or woe.
While it bound, it propels men's lusts and furies.
When it is freed, it tumbles, falls, and fades.
While it is bound, life will often thrive.
When it is freed, death will often follow.
What do I seek?
While it is bound, it chooses kings and peasants.
When it is freed, it foretells war or woe.
While it bound, it propels men's lusts and furies.
When it is freed, it tumbles, falls, and fades.
While it is bound, life will often thrive.
When it is freed, death will often follow.
What do I seek?
Hint:
Never Going To Jail
Hint:
Snap, Crackle And Pop
Hint:
The Highest Mountain In The World
Hint:
Add Your Riddle Here
Have some tricky riddles of your own? Leave them below for our users to try and solve.