In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?
Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?
One absent-minded ancient philosopher forgot to wind up his only clock in the house. He had no radio, TV, telephone, internet, or any other means for telling time. So he travelled on foot to his friend's place a few miles down the straight desert road. He stayed at his friend's house for the night and when he came back home, he knew how to set his clock. How did he know?
John was so frustrated to be the suspect of being a sleeper terrorist that he shoot himself right between the eyes with a revolver in his toilet. The revolver and the bullets were accurate. Minutes later John walks out of the toilet unharmed.
How can this be possible?
You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.
Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.
You ask him, "Does either of the family have a girl?"
To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."
Which family do you think is likely to have a girl?
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.