The day after tomorrow will be three days before Tuesday. Can you find out what is today?

On the dull night when the blonde was dozing, she heard an odd clamour and she saw that there was a bizarre man with a gun simply outside her home. So she raced to the telephone to call the police, however, she can't dial 911. Why?

A plane crashed between the border of Mexico and America. Where do you bury the survivors?

What has no start, end, or centre?

There are two candles. Both will only burn exactly for an hour. How will you use these two candles to measure forty-five minutes?

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?

A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

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?

Find the number of squares in the below-given picture.

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?