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?

There's one "sport" in which neither the spectators nor the participants know the score or the leader until the contest ends.

What is it?

What do you see in the given picture?

Place the numbers from 1 to 9 in the circles in a manner that each side of the triangle sums up to 17.

A network of 20 x 10 squares is given to you.

Can you calculate how many unique squares and rectangles can be formed combining two or more individual squares ?

John speaks the truth only once a day in a week. Below are a few hints for you:

First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".

Can you identify the day on which he speaks the truth?

One day, I thought of ways that can be used for creating a palindrome. So I decided that I will turn into a larger number by adding the reversed digits to the original number and keep doing it till I finally obtained a palindrome.

I am not sure if this process will always result in a palindrome eventually but I was able to produce a four-digit palindrome. Can you guess my starting number?

First, think of the colour of clouds. Next think the colour of snow. Last, think of the colour of the moon. Now, what do cows drink?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.

The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?