Solution:

Move: 1
White moves the knight to any position.

Move: 2
Black moves the pawn to position shown in the picture

Move: 3
White moves the knight back to original position.

Solution:

C7 => B8
Exchange pawn for a knight

Check-Mate

GameOver

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

The password is U472BMT.

Read aloud the line and you will sound something like "U Four Seven 2 B M T".

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:

The person on 73rd number will survive.

Explanation:
Till the number is the power of 2, the last person to survive will be the one who started it. But since the number here is not the power of 2, we will take the greatest power of 2 that is less than the number which is 64.
100 - 64 = 36
36 people are killed as 2, 4, 6, ..., 72. Thus the sword will now be given to the 73rd person. Now he is the first person to start in the remaining 64 people. Thus he will be the one to survive.

Solution:

Yes, some people are going get really tiny pieces but you were allowed for that right. Also, there is another way of doing it. Can you think of it?

Solution:

The check was for dollars 31.63.

The bank teller gave her dollars 63.31
She spent .05, and then she had dollars 63.26, which is twice the check.

Let x be the dollars of the check, and y be the cent.

The check was for 100x + y cent
He was given 100y + x cent

Also
100y + x - 5 = 2(100x + y)
Expanding this out and rearranging, we find:
98y = 199x + 5

or 199x ≡ -5 (mod 98)
or 98*2*x + 3x ≡ -5 (mod 98)
3x ≡ -5 ≡ 93 (mod 98)
this quickly leads to x = 31

Solution:

Let us denote the number of boys as 'p' and the number of girls as 'q'.

The first statement says that each boy has equal numbers of brothers and sisters
(p - 1) = q
=> p - q = 1 ------- (a)

The second statement says that every girl has twice as many brothers as that of sisters
2 (q - 1) = p
=> 2q - p = 2 ------- (b)

By solving (a) and (b)
We get q as 3 and p as 4.

Therefore, there are 4 boys and 3 girls in the family.

Solution:

This statement is true but only in a specific case i.e. if both of the siblings continue to live till the day the younger is as old as the elder one was during the time of their birth.

Solution:

There is no mention if you can use sign or not and thus the only possible way to get this is as follows:

(15 - 9) + (13 - 7) + (7 - 1) + (9 - 1) + (13 - 9)

If you solve inside the brackets, you will get the following equation
6 + 6 + 6 + 8 + 4
Adding all these numbers, you will get 30 which is the required sum.