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?
Tarang football website was hacked by one of the players. Jack, the coach of Tarang has pointed out five players as the possible hacker.
Each suspected player made three statements from each suspected player and out of which two are true and one is false.
Joseph
A) I have not hacked the website.
B) I know nothing about hacking.
C) John did it.
Hazard
A) I have not hacked the website.
B) The website was attacked by one of the players.
C) I hate Shelly
Remy
A) I have not hacked the website.
B) I have never seen Oscar in my entire life.
C) I am sure John did it.
John
A) I have not hacked the website.
B) I am sure Oscar did it.
C) Joseph was lying when he said he did it.
Oscar
A) I have not hacked the website.
B) I am sure Hazard did it.
C) I used to be friend with Remy.
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?
It has five wheels, though often think four, You cannot use it without that one more, You can put things in it, you can strap things on top, You can't find it in the market, but you can still go shop. What is it?
If we tell you that there is a relation between the numbers and letters in the given figure, can you analyze it and find the missing letter in the last box?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki