Solution:

60

Explanation:
You can encode MM in the first digit leaving the bottom segment MM (6^2=64>=60).
You will need some order so that they can represent the MM in binary.
Every single element of the display is a binary digit:
"On"=1
"Off"=0

Now, the seconds can be encoded in the similar fashion by using the second digit.

You can now use the remaining four elements of display (two bottom segments and two dots) to encode HH (4^2=16>=12).

Solution:

He should shoot at the ground.

If Kangwa shoots the ground, it is Rafael's turn. Rafael would rather shoot at Ferdinand than Kangwa, because he is better.
If Rafael kills Ferdinand, it is just Kangwa and Rafael left, giving Kangwa a fair chance of winning.
If Rafael does not kill Ferdinand, it is Ferdinand's turn. He would rather shoot at Rafael and will definitely kill him. Even though it is now Kangwa against Ferdinand, Kangwa has a better chance of winning than before.

Solution:

60 minutes

Explanation:
Roy will be able to consume all the five tablets in an hour.

Tablet 1 will be taken in 0 min.
Tablet 2 will be taken in 15 min.
Tablet 3 will be taken in 30 min.
Tablet 4 will be taken in 45 min.
Tablet 5 will be taken in 60 min.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

If two widows, each having a son married the son of the other widow, and then by the consummation of marriage, both the couples had a daughter, all the aforementioned relationships will turn to be true.

Solution:

192

Explanation:
I started with the number 192.
Adding the reversed 291 to 192 gave me 483.
Similarly,
483 + 384 = 867
867 + 768 = 1635
1635 + 5361 = 6996

Solution:

The young lady was presented with a bill which belonged to the elderly woman. She had asked the waiter to collect the bill from her daughter.

Solution:

The receptionist was pretty clever she played with the mute button of the phone while talking with her mother. She muted everything except the word emergency, call and help. So while talking, she sounded like 'Emergency… Call… Help' to her mother and thus she called the police.

Solution:

Jamie is a window cleaner who was tired after cleaning the windows on the 45th floor and thus leaped inside the building.

Solution:

Firstly: Policeman should take the thug across the river thames and escort the boat back with him. (Thug across, everyone else on this side)
Then, Policeman will take one cat along, leave it there, and on the way back, bring back the thug (since thug cannot be left with anyone without policeman's supervision).
Then Mrs. Mother will take the second cat on the other side. Drop it there and bring the boat back. For the 4th trip, Mrs. Mother And Mr. Father Will travel to the other side, and Mrs. Mother will stay there, and MR. Father will bring the boat back. (Now Mrs. Mother and 2 cats are on the other side.)
5th trip, the policeman takes the thug across. Both of them stay there and Mrs. Mother will come back. Then for the next trip, Mr. Father and Mrs. Mother will go on the boat, and Mrs. Mother will stay there, and Mr. Father will return back.
Then for the 7th trip, Mr. Father will travel with one dog. On the return, the policeman and the thug will return. Then in the next trip, the Policeman will take the second dog. (Now Mrs. Mother and her two cats; Mr. Father and his two dogs and the Policeman is here).
Now finally the policeman takes the boat on the other side and brings back the thug.
Tough one, right ?

Solution:

Fred Odea won.

Just look at the announcement lines. The first sentence in 'Ok now everybody!' If you take out just the first letter of every word, it will form 'ONE'. In the same manner the second sentence 'The winner of…..' will give form 'TWO' and the third sentence 'The Hardest Riddle Ever Event.' Will form THREE.

Thus the final sentence must form FOUR. There is only one candidate who can suffice with the first two letter and he is Fred Odea. The final sentence of the mastermind must be, 'Fred Odea: Ultimate Riddler!'