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.
There are two beautiful yet remote islands in the South Pacific. The Islanders born on one island always tell the truth, and the Islanders from the other island always lie.
You are on one of the islands and meet three Islanders. You ask the first which island they are from in the most appropriate Polynesian tongue, and he indicates that the other two Islanders are from the same island. You ask the second Islander the same question, and he also indicates that the other two Islanders are from the same island.
Can you guess what the third Islander will answer to the same question?
In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.
A solo dice game is played. In this game, upon each turn, a normal pair of dice is rolled and the score is calculated not by adding the numbers but multiplying them.
In a particular game, the score for the second roll is five more than what was achieved in the first roll. The score for the third roll is six less than what was completed in the second roll. The score for the fourth roll is eleven more than what was achieved in the third. The score for the fifth roll is eight less than what was completed in the fourth.
Can you calculate the score for each of the five throws?