A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

If you toss a coin 10 times and it lands heads up every time, what are the chances it will land heads up if you toss it again?

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

Why is 6 afraid of 7?

You need to remove two matchsticks to make the below equation true. Can you do it ?

Can you find out the remainder when 3^300 is divided by 5?

500 women soldiers are arranged in an array of ten rows and fifty columns in accordance with their respective heights. Now, the tallest woman from each row is asked to move out in the front. From them, the shortest one is labelled as Alpha. They are then asked to resume their original position.

Now, the shortest woman in each column is asked to come out in front. The tallest among them is labelled as Beta.

Can you find out if Alpha will be taller or Beta?

Replace the (?) with the correct mathematical signs to make the expression equal to 59.

18 ? 12 ? 4 ? 5 = 59

James bond was pushed out of an aeroplane without any parachute.
He survived, How come?

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?