The solution is shown below.

1. Qc3+ Ka2 2. Qc1 Kb3 3. Qa1 Kc2 4. Qa2+ Kc3 5. Qb1 Kd2 6. Qb2+ Kd1 7. Qa2 Kc1 8. Qb3 Kd2 9. Qb1 Kc3 10. Qa2 Kd3
If 4. … Kc1, then 5. Qb3 and we get to the position in move 8. If 4. … Kd1, then 5. Qb1 Kd2 6. Qb2+ and we get to the position in move 6.

The solution is shown below.

You can point your finger to one of the two rooms and ask any of the keepers the question “If I ask the other keeper whether this room leads to Heaven, would he say YES?”. If the answer is NO, go through that door, if the answer is YES, go through the other one.

1. There are 4 people.
2. They arrived a few days ago, enough so that a spider web can appear on the tent.
3. Judging by the paddles, they got there with boats.
4. There is a hen walking around the camp, so the closest village is not far away.
5. The leaves of the trees are larger at the south side, so the wind must be blowing from the South.
6. The shadow is pointing towards West, so it must be morning.
7. Alex went to catch butterflies.
8. Since Peter is on duty today – cooking food for the group, it was Colin on duty yesterday.
9. Today is August 8. Watermelons ripen in August.

The solution is shown below.

First, we put 3 balls on the left side and 3 balls on the right side of the balance scale. If the scale tips to one side, then the defective ball is there. If not, the defective ball is among the remaining 3 balls. Once left with 3 balls only, we put one on each side of the scale. If the scale tips to one side, the defective ball is there. If not, the defective ball is the last remaining one. Clearly we can not find the defective ball with just one measurement, so the answer is 2.
If you had 2000 balls, then you would need 7 measurements. In general, if you have N balls, you would need to make at least log₃(N) tests to find the defective ball. The strategy is the same: keep splitting the group of remaining balls into 3 (as) equal (as possible) subgroups, discarding 2 of these subgroups after a measurement. To see that you need no less than log₃(N) tries, notice that initially there are N possibilities for the defective ball and every measurement can yield 3 outcomes. If every time you get the worst outcome, you will make at least log₃(N) tries.

The answer is shown below.

You can tell them “You will drown me”. This will result in a paradox – if your sentence is true, then they will drown you, but on the other hand will be forced to burn you, which is a contradiction. Similarly if your sentence if false. Therefore they will not have a choice except to give up on their plan.

The solution is shown below.