A network of 20 x 10 squares is given to you.

Can you calculate how many unique squares and rectangles can be formed combining two or more individual squares ?

Can you find the ages of a son, father and grandfather based on the following facts?
The sum of the ages of grandfather, father and son is 140 years.
The age of the son in months is the same as the grandfather in years.
The age of the son in days is the same as the father in weeks.

That attorney is my brother, testified the accountant.

But the attorney testified he didn't have a brother.

Who is lying?

What question can you never answer yes to?

John killed hundreds of people mercilessly and yet the police were not able to put her behind the bars. Why?

What work can one never finish?

You walk into an old horror house. It has no power or plumbing. Once inside, you see three doors. Each door has a number on it. Behind each door is a way for you to die. Behind door number one, you die by getting eaten by a lion. Behind door number two, you die by getting murdered. Behind door number three, you die by an electric chair. You can’t turn back, so you have to go through a door. Which door do you go through?

Can you find the hidden animal in the picture below?

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

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?