In Normalville, every inhabitant is either a knight, a liar, or a normal. Knights always tell the truth. Liars always lie. Normals tell the truth and lie completely at random. You are going to Normalville when you see a fork in the road. There are two ways to go. One of them leads to Normalville. You see three inhabitants by the fork, A, B, and C. You know that only one of them is a normal, but you are not sure who it is. In two "yes" or "no" questions, how do you find the way to Normalville? (Each question can only be addressed to one person, but it can be a different person for each question.)
(In reply to
re(4): no cigar by Ady TZIDON)
If A is a normal, then B and C cannot be normals because there is only one normal. We need a question such that if A says, "Yes," then C is not a normal, and if A says, "No," then B is not a normal. Suppose A is a normal and says, "Yes." Then, we still know that C is not a normal because there is only one normal. Suppose A is a normal and says, "No." Then, we still know that B is not a normal because there is only one normal.

Posted by Math Man
on 20121007 13:20:51 