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?

What goes up but never comes down?

In front of you, there are 9 coins. They all look absolutely identical, but one of the coins is fake. However, you know that the fake coin is lighter than the rest, and in front of you is a balance scale. What is the least number of weightings you can use to find the counterfeit coin?

There are three houses in a straight row. One is red, one is blue, and one is white. The red house is left of the middle. The blue house is right of the middle. Where's the white house?

If I remove one from eleven it becomes Ten and if I remove one from nine also becomes Ten. How?

A man is looking at a photograph of someone. His friend asks who it is. The man replies, “Brothers and sisters, I have none. But that man’s father is my father’s son.” Who was in the photograph?

They do not possess flesh or feathers or scales or bone
But still, they are blessed with fingers and thumbs of their own.

A man lives on the fifteenth floor of an apartment building. Every morning he takes the elevator down to the lobby and leaves the building. In the evening, he gets into the elevator, and, if there is someone else in the elevator, or if it was raining that day, he goes back to his floor directly. Otherwise, he goes to the tenth floor and walks up five flights of stairs to his apartment. Can you explain why he does this?

We can be boring,Or interesting.
We can be long,Or short.
We can have pictures,Or just words.
Many love us,But many also hate us.
What are we?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?