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?

This is a classy optical illusion puzzle. What more you can find except bricks in the image below?

Can you count the number of triangles in the picture below?

Sally lives in a place where six months of the year is mild summer and the temperature drops significantly the other six months. She owns a lake where there is a small island. She wants to build a house on the island and needs to get materials there. She doesn’t have a boat, plane, or anything to transport them to the island. How does Sally solve this problem?

Jessica is telling her friends this story and asks them to guess if it’s the truth or a lie: “There was a man sitting in a house at night that had no lights on at all. There was no lamp, no candle, and no other source of light. Yet, he sat in the house and read his book happily.” Her friends say she’s lying, but Jessica corrects them and says she’s telling the truth. Jessica’s story is true—but how?

The sum of a mother, her baby and her dog's weight is 170 Kg. How much does the baby weigh if the mother weighs 100 kg more than the combined weight of the baby and the dog, and the dog weighs 60 per cent less than the baby?

Rectify the following equality 101 - 102 = 1 by moving just one digit.

Name a key which is hardest to turn.

A mile-long train is moving at sixty miles an hour when it reaches a mile-long tunnel. How long does it take the entire train to pass through the tunnel?

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?