Solve the alphametic puzzle by replacing the alphabet with the number.

S T O R M +
S O L E S
=========
T O W E L
=========

You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)

The King of a distant land had heard that Birbal was one of the wisest men in the East and so desired to meet Birbal. He sent Birbal an invitation to visit his country.

In due course, Birbal arrived in the distant kingdom. When he entered the palace he was flabbergasted to find not one but six kings seated there. All looked alike. All were dressed in kingly robes. Who was the real king?

The very next moment he got his answer. Confidently, he approached the king and bowed to him.

How did Birbal know who was the real king?

Here is what you have to do. You have to throw a ball as hard as you can but it must return back to you even if it does not bounce at anything. Also, you have nothing attached to the ball. There is no one on the other end to catch that ball and throw it back at you.

How will you do it?

Twenty frogs are sitting on a log floating on the surface of a river. Two of them decide to jump off into the water.

How many frogs are there on the log at this moment?

Rebus Puzzle Definition: A rebus is an illusion device that uses pictures to represent words or parts of words.
What does This Rebus Puzzle Identify?

Find three numbers such that When we multiply three numbers, we will get the prime numbers. The difference between the second and the first number is equal to the third and second.

In the given picture, in how many ways can you read the word "Tiger"?

The centre of the third figure is empty. What digit should fit inside?

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?