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 research team went to a village somewhere between the jungles of Africa. Luckily for them, they reached the day when quite an interesting custom was to be performed. The custom was performed once a year as they confirmed and was performed in order to collect the taxes from every male of the region.
The taxes were to be paid in the form of grains. Everyone must pay pounds of grain equaling his respective age. This means a 20-year-old will have to pay 20 pounds of grain and a 30-year-old will pay 30 pounds of grain and so on.
The chief who collects the tax has 7 weights and a large 2-pan scale to weigh. But there is another custom that the chief can weigh only three of the seven weights.
Can you find out the weights of the seven weights? Also, what is the maximum age of the man that can be weighed for the payment of taxes?
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
A man plots the murder of his wife. His plan is full proof. Nobody saw them leaving their house. He stabbed her with a knife while driving. She died on the spot. He threw her body in a valley. He threw the knife carefully wiping his finger prints on a random garbage bin. Then he went back to his home and no one was watching him this time as well.
After an hour, he was called by the local police department who informed him that his wife was murdered. They asked him to reach the scene of crime immediately. But as soon as he arrived at the crime scene, he was arrested by them.
How did the police know that he himself is the murderer?
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.