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?
Today is John's birthday.
A year ago, John had five candles and he lit all the candles except the one at the last.
Now he is going to light all the candles.
A devotee visits 9 temples when he visits India. All these nine temples have one thing in common - there are 100 steps in every temple. The devotee puts the Re.1 coin after climbing up every step. He does the same while climbing down every step. At each temple, the devotee offers half of his money from his pocket to god. In this way, his pocket becomes empty after he visits the 9th temple.
Can you calculate the total amount he had initially?
You have to fill the below given grid in a manner that every row and column contains the digits 1 to 6. Also, make sure that the squares that are connected with each other must contains the same digit.