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?
John was writing his first book. After saving the document, he locked his laptop with a password and mentioned some phrases for the hint box.
A friend of his tried opening his laptop but found out that it was password protected. Following is the hint that appeared.
1 mobile 3 books 2 roars 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches.
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?
The Puzzle: Here is a famous prize problem that Sam Loyd issued in 1882, offering $1000 as a prize for the best answer showing how to arrange the seven figures and the eight 'dots' .4.5.6.7.8.9.0. which would add up to 82