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?
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.
If we tie a Sheep to one peg, a circled grass is been eaten by the Sheep. If we tie the Sheep to two pegs with a circle on its neck, then an eclipse is eaten out of the grass by the Sheep. If we want an eclipse then we put two pegs and then put a rope in between them and the other end of the rope is tied up on the Sheep's neck.
How should we tie the peg and the Sheep so that a square is eaten out from the garden grass? We only have one Sheep rope and the peg and the rings.
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
In a box, there is a jumble of 7 red balls, 6 blue balls, 5 green balls, and 4 yellow balls. What is the minimum number of balls, will you have to pick up so that you have at least 4 balls of the same colour?
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