Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour 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 $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

Solve the rebus riddle in the picture below.

Find the value of "?" in the ball picture Riddle below:

A man is found dead in his bathroom naked with blood scattered all around him. The bathroom was locked from the inside and there is no trace of any struggle. There is nothing in the bathroom except his pant with the belt still around and his shirt. Also, the medic team can't find any incision in his body that may have been the reason behind so much blood loss.

The Police department is clueless regarding this murder mystery.
Can you?

Name a key which is hardest to turn.

Can you find the missing number in the third row?
35 20 14
27 12 18
5 2 ?

You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?

What is next number in the pattern below:

131 517 192 123 ?

Given that

(78)^9 = 6
And (69)^4 = 11

Can you find out

(99)^2 =?

(Note: This is Logical, not Mathematical)

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?