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?

I want to fill my bucket using both cold and hot water.
I have two taps for both cold and hot water. The hot water tap fills the bucket in exact 6 hours and the cold water tap fills the bucket in exact 4 hours.
I turn both of them simultaneously but I forgot to turn off another tap which removes the water out of the bucket. This tap can empty the bucket in 12 hours.

How Long will it take to fill the bucket?

Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel?

There were two grandmothers and their two granddaughters.
There were two husbands and their two wives.
There were two fathers and their two daughters.
There were two mothers and their two sons.
There were two maidens and their two mothers.
There were two sisters and their two brothers.
Yet there are only six, who are buried here,
All are born legitimate and relationships clear.
How can this happen?

What is full of holes but still holds water?

A word I know,
Six letters contain,
Subtract just one,
And twelve is what remains.

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?

If we change the South-East direction into North and North-East into West and all others similarly.
Can you find out which direction will be in the place of South-West direction?

Replace all '*' with digits 1, 2, 3, 4, 5 and 6 to make below statement true.

* *
x *
=====
* * *

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?