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 person was killed at a house party. When the police arrive, there are six people present in the house who are the friends of the victim. The name of the friends is Rohit, Aman, Nick, Gagan, and Randy.
Near the dead body, they find a few numbers written with blood by the victim on the floor. The numbers are 8, 5, 4, and 11.
The police arrests one of the friends for the murder. Whom did they arrest and why?
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?
