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?
We have arranged an array of numbers below. What you have to do is use any kind of mathematical symbol you know excluding any symbol that contains a number like cube root. You can use any amount of symbols but you have to come up with a valid equation for all of them.
There was a blind beggar living on the footpath of a street. Suddenly one day, the beggar's brother died. What was the relation of the blind beggar with the person who died?
A chess tournament is taking place on knock-out terms (the one who loses the match is out of the game).
(a) If 10 matches are played in total, how many players participated?
(b) If 20 players took part in the tournament, how many matches were played?
👉 I am a 7 letter word.
👉 I like mornings
👉 If you remove my 1st letter you can drink me
👉 If you remove my 1st & 2nd letters 👉 you may not like me
👉 If you remove my last letter, you will see me on television
👉Answer is really very interesting
Let us see who solves this....
On a magical land of Mexico , all the animal in the land are rational.
There are 10 tigers and one goat.
Tiger can eat goat but since it's a magical land , the tiger who eats the goat , turns into goat and then can be eaten by the remaining tiger(s).
If we leave them for some time then how many goat and tiger will be there , when we come back ?
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.
