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?
Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.
They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?
You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.
Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.
Its something that each of us devours,
Not just us but birds, beats, trees, and flowers,
Frets iron and nibbles steel,
Toil hard stones to meal,
Exterminates king, collapse town,
And blows the mountains down.