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
=========

Two guards were on duty outside a barracks. One faced up the road to watch for anyone approaching from the North. The other looked down the road to see if anyone approached from the South. Suddenly one of them said to the other, "Why are you smiling?"

How did he know his companion was smiling?

John was drowned by he was not wet. How?

A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

If all the below statements are true

1. Gianni was either in Italy or France in 1997.
2. If Gianni did not kill Versace, Hilton must have killed him.
3. If Versace died of suffocation, then either Gianni killed him or Versace committed suicide.
4. If Gianni was in Italy in 1997, then Gianni did not kill Versace.
5. Versace died of suffocation, but he did not kill himself.

Who killed Versace and where was Gianni in 1997?

What is the next number in this series?

4,12,84,3612....

Some friends went on a vacation to a resort. It was raining heavily and it kept raining for thirteen days.

When it rained in the morning, the afternoon was beautiful and when it rained in the afternoon, the day was blessed with a clear morning.

Overall, the friends experienced eleven nice mornings and twelve nice afternoons. Can you find out the number of days they spent on vacation?

ENEMY = 2 * LINK
LINK + 2 = HELL

Then what will be TAXI + HELL? Select from the options below:
a) ROTTEN
b) DANGER
c) HEAVEN
4) MORTAL

John is 45 years older than his son Jacob. If you find similarities between their ages, both of their ages contain prime numbers as the digits. Also, John's age is the reverse of Jacob's age.

Can you find their ages?

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?