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?

John leaves home and then he takes three right turns. John wants to return to home but he was scared of Jacob, who is wearing a mask.

What is John Situation ?

I went to the bookshop and spent one-half of the money that was in my purse.

When I came out, I found that I had as many cents as I had dollars and half as many dollars as I had cents when I went in. Find the money in my purse when I entered the store.

You have a square. What you have to do is cut and reassemble the square such that you create a Red Cross sign that has the same volume as that of the square.

There are two arch enemies Messi and Ronaldo who hate each other to an extreme. One day both were going together and a Jeanie appeared in front of them. Jeanie grants 3 wishes to Ronaldo and one to Messi.

Messi replied smartly 'Give me twice whatever Ronaldo demands'.

Ronaldo asked his 1st wish 'Give me 10000 billion dollars. Soon Messi gets 2000 billion dollars.
Ronaldo asked for his 2nd wish 'Give me one mansion in every country in the world. Soon Messi gets two mansions in every country of the world?

What should be Ronaldo's third wish?

How can you write nineteen in a manner that if we take out one, it becomes twenty?

Can you complete the sequence puzzle?

AR TA GE CA LE VI LI _

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?

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?

You need to pick one entry from pot A and one from pot B to have a perfect match. Can you do it?