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?
An equation has been laid down using a few matchsticks. However, as you can see, the equation is not correct. Can you correct the equation if you are allowed to add or remove 5 matchsticks?
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