Solution:

The best way to analyze the situation would be forcing a win for white when the black player plays anywhere but a corner square. Refer to the given figure for the current positions. Now, if black plays 7 to block the white player from having three in a row, white will move 5 to 6 and will win. But since you get to place only three markers, black can place the marker at 6 and white won't be able to add one more at 7 to win. And moving the 9 marker to 7 will take two steps.

But white can still get to square 7 before black is able to block him or form a three in a row. In this manner, no matter what black does, the white player can always win the game if he begins from the center square.

Solution:

12 steps:

Steps 11 Liter jug 6 Liter Jug
1. 11 -
2. 5 6
3. 5 0
4. 0 5
5. 11 5
6. 10 6
7. 10 0
8. 4 6
9. 4 0
10. 0 4
11. 11 4
12. 9 6 ==> i found 9 liter in 11liter jug(as required)

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

Solution:

Baseball umpire and the Catcher (Eden Hazard was playing baseball.)

Solution:

First fill the 8 liters jug complete - 4, 8, 0
Fill the 5 liters jug with 8 liters jug - 4, 3, 5
Pour back the beer from 5 liters jug to 12 liters jug - 9, 3, 0
Pour the 3 liters from 8 liters jug to 5 liters jug - 9, 0, 3
Fill the 8 liters jug completely from 12 liters jug - 1, 8, 3
Fill the 5 liters jug from the 8 liters jug - 1, 6, 5
Pour the entire 5 liters jug back in 12 liters jug - 6, 6, 0

You have successfully split the beer into two equal parts.

Solution:

2 cakes

At each toll bridge you are required to give half of your cakes, and you receive one back. Which leaves you with 2 cakes after every bridge.

Solution:

They use the bricks and dirt from the tunnel to stand on it.

Solution:

The attached picture shows you how you can do it. If you were able to deduce any other way, feel free to comment.

Solution:

Let m be initial number of flowers and n be the flowers offered at each temple by the man.
Initial flowers = m
After stepping into the first temple = 2m
Flowers offered at the first temple = n
Remaining flowers = 2m – n

After stepping into the second temple = 4m – 2n
Flowers offered at the second temple = n
Remaining flowers = 2m – n

After stepping into the third temple = 8m – 6n
Flowers offered at the third temple = n
Remaining flowers = 8m – 7n

Now as per the question (8m – 7n) must be equal to 0.
i.e. 8m – 7 n = 0
or 8m = 7y

Now the least numbers required to solve this equation are 7 and 8 for m and n respectively.

Thus m = 7; n = 8
Which means, the man had 7 flowers in the beginning and he offered 8 flowers at each temple.

Solution:

Steps:
1) Light fire on first bar from both the ends and second bar from one end.

2) After 30 seconds(when first bar gets completely burned out) , burn the second bar from second end as well.

3) When second run completely gets burned , you know its 45 seconds.

Solution:

Although it looks complicated, the answer is simple. The password to his computer is JIGSAW.
1st letter of Jug = J
2nd letter of Birthdays = I
3rd letter of Fights = G
4th letter of Cars =S
2nd letter of Laptops = A
1st letter of Watch = W