Solution:

dead

Solution:

1653

Explanation:
For an ideal case, the batsman will hit a six on each ball. But if he hits six on the last ball of the over, the strike will change in the next over. Thus, the best he can do in the last ball is run 3 runs so that he retains the strike even in the next over. Thus the total runs that he can score in each over:
6 * 5 + 3 = 33
But this will have to go like it only till the 49th over. In the last over, he can hit a six in the last ball as well as that will be the last ball of the match.
Thus runs for the last over will be 6 * 6 = 36.
Hence the maximum runs = 33 * 49 + 36 = 1653

Solution:

The two numbers are 4 and 13 whose product is 52 and sum is 17.

Solution:

The Password.

Explanation:
Clues 2 and 5 are correct and rest are lies.

Solution:

C7 => B8
Exchange pawn for a knight

Check-Mate

GameOver

Solution:

The wise man told them to switch the horses and then race. In this manner, both of them will be willing to race as fast as they can to prove that the other horse (his own horse) is slow.

Solution:

Sam : 2
Dean : 5
Castiel : 7

Age diff
7 - 2 = '5' is prime
7 - 5 = '2' is prime
5 - 2 = '3' is prime

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.

Solution:

Since Jasmine and Thibault ate equal amount, they should pay the same amount. But since that's not possible, they can decide with 'rock, paper, scissor' or an equivalent measure to determine who will pay the extra dollar. Now, let's assume tha Jasmine pays $1 extra after losing

Jasmine will pay $5, Thibault will pay $4 and Noah will pay $2.

If the pizza's cost was $11, we can simply keep the same offset and divide. Jasmine is paying 6% more, Thibault is paying 15% more and Noah is paying 27% more.
Keeping the offset same both Jasmine and Thibault will pay $5 each and Noah will pay $1.

Solution:

They are matched as shown in the picture below.

Solution:

Let us assume that all of them are standing on the X shore and they have to travel to the Y shore.

X = mother, first daughter, second daughter, father, first son, second son, maid and dog
Y = None

Maid and dog go first and maid returns back
X = mother, first daughter, second daughter, father, first son, second son and maid
Y = dog

Maid and first son go and maid returns with dog
X = mother, first daughter, second daughter, father, second son, maid and dog
Y = first son

Father and second son go and father returns back
X = mother, first daughter, second daughter, father, maid and dog
Y = first son and second son

Mother and father go and mother comes back
X = mother, first daughter, second daughter, maid and dog
Y = father, first son and second son

Maid and Dog go and Father returns back
X = mother, first daughter, second daughter and father
Y = first son, second son, maid and dog

Father and Mother go and mother comes back
X = mother, first daughter and second daughter
Y = father, first son, second son, maid and dog

Mother and first daughter go and maid comes back with dog
X = second daughter, maid and dog
Y = mother, first daughter, father, first son and second son

Maid and second daughter go and maid comes back
X = Maid and dog
Y = mother, first daughter, second daughter, father, first son and second son

Maid and dog go
X= none
Y = mother, first daughter, second daughter, father, first son, second son, maid and dog

Thus everyone has reached the other end.