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?

While preparing the table for dinner, wife came up with an idea to tease his mathematician husband. She asked her husband to pick nine toothpicks and make ten without breaking any toothpick.

The husband was also smart and did it within seconds. How ?

What's the only room from which no one can enter or leave

It's a 7-letter word.
If we remove 1 letter from it, it remains the same.
If we remove 2 letters from it, it remains the same.
If we remove 3 letters from it, it remains the same.
If we remove all the letters from it, still it remains the same.
What is it?

How many bricks does it take to complete a building that is 15 feet wide, 30 feet deep, and 12 feet tall made of brick?

Complete the given grid with valid words. You can only use the letters AAEEIIMMPPTT.

Hint: The grid reads the same across as down.

Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.

How many miles does the pigeon travel?

A plane crashed between the border of Mexico and America. Where do you bury the survivors?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

Can you find the thief by just looking at the picture below?