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?
There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.
How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?