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 father is locked up in jail. His wife has gone bankrupt. Their male child has to sell his hotel in order to gain some money. Yet their girl child does not care and is quite happy.
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?
One day, I thought of ways that can be used for creating a palindrome. So I decided that I will turn into a larger number by adding the reversed digits to the original number and keep doing it till I finally obtained a palindrome.
I am not sure if this process will always result in a palindrome eventually but I was able to produce a four-digit palindrome. Can you guess my starting number?