A guard is positioned at the one side of the bridge saying ‘A’. His task is to shoot all those who try to leave from ‘A’ to the other side and say ‘B’. He also need to welcome the person who comes from another side ‘B’ to his side ‘A’. The guard comes out of his post every 1 hour and looks down the bridge for any people trying to leave. You are at side ‘A’ and wish to go to another side ‘B’. you also know that it would take 1:45 hr to cross the bridge. How will you cross the bridge?

There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?

If an electric train is travelling south, then which way is the smoke going?

_ _ _ IE _ _
_ _ _ IE _
_ _ IE _ _
_ _ IE _
_ _ _ _ IE

Like you see, some letters have gone missing from these words that contain the IE pair at some or the other place. The letters that will be used to fill the blanks are given below. Use them and form meaningful words. Can you do that?

A, C, D, F, H, K, L, M, N, N, O, R, R, S, S, S, T, T, Y and Y.

In the following series, a set of numbers is progressing with a particular pattern. Can you deduce that pattern and find the missing set?

(2 + 6), (21 + 6), (58 + 6), (119 + 6), ___

What is the last thing you take off before bed?

I guess 76.8% of readers will like this riddle.

What's the least number of people should read this post?

They are three errirs in this question. Can you find them?

If we tie a Sheep to one peg, a circled grass is been eaten by the Sheep. If we tie the Sheep to two pegs with a circle on its neck, then an eclipse is eaten out of the grass by the Sheep. If we want an eclipse then we put two pegs and then put a rope in between them and the other end of the rope is tied up on the Sheep's neck.

How should we tie the peg and the Sheep so that a square is eaten out from the garden grass? We only have one Sheep rope and the peg and the rings.

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?