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?
A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them into two equal halves.
Can you help him divide the land in a manner that both of his sons will be happy?
John was running from 40 thieves. John has got 3 gold boxes which weigh as 4kg, 2kg, and 1kg respectively. A witty man asked John to stay with him for seven days in exchange for 1kg gold per day. John needs to stay there for seven days and also do not want to give the witty man any advance. How can John pay for his seven days stay?
Two friends were betting. One said to the other, "The coin will be flipped twenty times and each time the coin lands on the head, I will give you $2 and each time it lands on the tale, you will give me $3." After flipping the coin twenty times not a single penny was exchanged among them.
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