Three gods A, B, and C are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of A, B, and C by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which.
Having one answer randomly is obviously problematic. So, with only three questions, the first priority will be to find a god who is not random. I think this could be accomplished by asking one of them, let's say A, 'If I asked you whether B is Random, would you answer 'da''? Of course I don't know what 'da' means, but by phrasing the question in this way, it doesn't really matter. If we say A responds with 'da', and if 'da' means 'no, then his answer means that he would not say no. If 'da' means yes, his answer means that he would say yes. Those two responses mean exactly the same thing. Similarly, if he says 'ja' and if 'ja' means yes, he is saying that he would say no. And if 'ja' means no, he is saying that he would not say yes. Again, the meaning is the same. By asking the question recursively like this, True and False will respond the same way. If you simply ask False whether B is Random, False will obviously give the incorrect answer. But if you ask False what he would say when asked that question, he has to lie about what his answer would be, which effectively means that he has to give the correct answer to initial question. So, in this way, I think I should be able to work out that one of the three is not Random. If A says 'da' (either he wouldn't say no, or he would say yes, to B being random) then either B is Random, or A himself is Random and arrived at his answer randomly. But C is definitely not Random. If A says 'ja' (he wouldn't say yes, or he would say no) then either A or C must be random, but definitely not B. For simplicity's sake, let's assume that A responded 'ja' to that first question. So I have now deduced that B is not Random. The next step, I think, will be to determine whether B is True or False. We still have the difficulty of not knowing what 'da' and 'ja' mean, but we should be able to avoid that in the same way. So I ask B, 'If I asked you whether you were True, would you answer 'da'? True will answer 'da', regardless of whether that means 'yes' or 'no', since the meaning of the answer is the same. He is either saying 'Yes, I would answer 'yes',' or 'No, I would not answer 'no'.' False has to lie about how he would answer the question, which means he has to give the truthful answer to the question. That will be 'ja', either meaning 'Yes, I would say 'no',' or 'No, I would not say 'yes'.' So based on this answer I can determine whether B is True or False. For my final question, I would again ask B. There doesn't seem to be anything in the rules preventing this. Keeping in mind that we still don't know what 'ja' and 'da' mean, I will still need to use that recursive structure. So I will ask B 'If I were to ask you whether A is Random, would you say 'ja'? An answer of 'ja', regardless of whether B is True or False, will mean that A is Random. An answer of 'da' will mean that A is not Random. Either way, this gives us enough information to identify all the Gods. If A is Random then C is either True or False (whichever one B is not) and if A is not Random, then C is Random and A is True or False (whichever one B is not).
my mind ow
lol my class had a research and a discussion bout it
Join our real-time social learning platform and learn together with your friends!