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?
During a secret mission, an agent gave the following code to the higher authorities
AIM DUE OAT TIE MOD
However, the information is in one word only and the rest are fake. To assist the authorities in understanding better, he also sent them a clue, If I tell you any one character of the code, you can easily find out the number of vowels in the codeword.
You are presented with three boxes. One of them has a red ball inside and the other two have a black ball inside each of them. You are asked to pick up the one with red ball and you pick one. Now, one of the other boxes is opened and it is found to have a black ball.
You are presented with a chance to change your box with the one that is left closed. Will you change your box? Why or why not?
It spends most of its day eating white, but when it’s quick enough, it gets to eat fruit and sometimes some blue things. It’s in a dark room, where the walls are blue, it runs from a ghost that roams the halls and haunts it all the time. What is it?
Take number 1000 and then add 20 to it.
Now add 1000 one more time.
Now add 30.
Now add 1000 one more time.
Now add 40.
Now add 1000 one more time.
Now add 10.
The Federal bank of London is abducted by the robbers. The head of the robbers asked the cashier to empty their money vault to them and when suddenly cashier got a call from her father. To avoid any suspicion, the robber asked the cashier to pick the call and reply her father in the shortest manner possible.
The cashier told her father "Is there an emergency father, Call me when you are free and I will help you in your furnishing" and then the cashier hung up the phone.
After 10 minutes, police arrived at the crime scene.
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
