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?

A B C D E F G H

These are the letters given to you. Now you have to find out the letter that comes two to the right of the letter which is immediately to the left of the letter that comes three to the right of the letter that comes midway between the letter two to the left of the letter C and the letter immediately to the right of the letter F.

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

One absent-minded ancient philosopher forgot to wind up his only clock in the house. He had no radio, TV, telephone, internet, or any other means for telling time. So he travelled on foot to his friend's place a few miles down the straight desert road. He stayed at his friend's house for the night and when he came back home, he knew how to set his clock. How did he know?

A father is locked up in jail. His wife has gone bankrupt. Their male child has to sell his hotel in order to gain some money. Yet their girl child does not care and is quite happy.

How can someone be so rude?

Six people park their car in an underground parking of a store. The store has six floors in all. Each one of them goes to a different floor. Simon stays in the lift for the longest. Sia gets out before Peter but after Tracy. The first one to get out is Harold. Debra leaves after Tracy who gets out on the third floor.

Can you find out who leaves the lift on which floor?

A tourist visits a small town for his research. While in the town, he decides to get a haircut. Since the town is quite small, there are only two barbers in the town � one on the North Street and one on the South Street. The barbershop on the North Street is a mess and the barber has a weird and pathetic haircut. While the barbershop at the South Street is pretty tidy and the barber as well has an impressive haircut.

Which barbershop will the tourist visit for his haircut and why?

Solve the rebus riddle in the picture below.

If a zookeeper had 100 pairs of animals in her zoo, and two pairs of babies are born for each one of the original animals, then (sadly) 23 animals don’t survive, how many animals do you have left in total?

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?