John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.
Seeking this behaviour, can you tell whether he likes balloons and parties?
A man escapes from jail using help from his girlfriend. The investigators suspect four girls of being the man's girlfriend.
Out of those four girls, one is his girlfriend who is lying. Two of the girls are completely innocent and are speaking the truth. One of the girls is the man's sister who is helping the girlfriend lie. Following are the statements from all four of them:
Ariana: "Myrna is his girlfriend."
Jane: "Angelina is lying."
Angelina: "Ariana is lying."
Myrna: "Jane is not his sister."
Can you find out who is the man's sister among them?
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?
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?
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