Hardest Logic Puzzle Answer: 3 Gods [Solved]

Answer: Ask god B one embedded question to find a god who is not Random, then ask that god two more embedded questions, and the hardest logic puzzle answer names all three gods.

The hardest logic puzzle answer is a three question method, not a lucky guess. It works even though you do not know which word means yes, and one god answers at random. The trick is to ask a question about the answer itself, so the same reply means the same thing no matter who answers it.

The Puzzle

Three gods stand before you, called A, B, and C in no particular order. One is True, and he always speaks truly. One is False, and he always speaks falsely. One is Random, and he answers truly or falsely at random, as if a coin in his head decided each time. You must work out which god is which.

You may ask three yes or no questions in total, each to exactly one god. You may ask the same god more than once, and later questions may depend on earlier answers. The gods understand English, but they answer only in their own language. Their words for yes and no are da and ja, in some order, and you do not know which word means which.

Logician George Boolos called this the hardest logic puzzle ever (Harvard Review of Philosophy, 1996, after Raymond Smullyan). It stacks two unknowns at once: an unknown language and an unknown liar.

Why Direct Questions Fail

Start with the obvious question and watch it fail. Ask god A, “Are you True?” He answers da. What have you learned? Nothing yet. If da means yes, a True god would say it, but a False god would also say it, because he lies about being False. If da means no, the same problem runs in reverse.

Next, try to find Random first. Ask god A, “Are you Random?” Again, the answer tells you little. A True god says no, a False god says yes, and Random says either one. You still cannot decode da and ja.

The Hardest Logic Puzzle Answer in Three Questions

The embedded question trick

Instead of asking a plain question, ask a god what he would answer. Take any statement P, and ask: “If I asked you P, would you answer ja?” For True and False alike, the reply is ja exactly when P is true, and da exactly when P is false. The unknown language cancels out.

Why the trick works in either language

First, suppose ja means yes. A True god asked P would answer ja when P is true. A False god asked P would answer da when P is true, so he lies and says ja. Both say ja when P is true, and da when P is false.

Next, suppose ja means no. A True god asked P would answer da when P is true. So the statement “you would answer ja” is false, and he answers with the no word, which is ja. A False god asked P would answer ja when P is true. So the statement is true, and he lies and answers with the no word, which is ja again.

God asked	What ja means	Reply when P is true	Reply when P is false
True	Yes	ja	da
True	No	ja	da
False	Yes	ja	da
False	No	ja	da

That table is the engine of the solution. For any god who is not Random, read ja as true and da as false.

Question 1: Find a god who is not Random

Ask god B: “If I asked you, is A Random, would you answer ja?” Read the reply through the table. B himself might be Random, but both branches point to a safe god.

If B answers ja, then either B is not Random and A is Random, or B is Random. If B is not Random, A is Random, so C is not Random. If B is Random, C is not Random either.

If B answers da, then either B is not Random and A is not Random, or B is Random. If B is not Random, the reply itself says A is not Random. If B is Random, A is not Random either.

So one question buys you a god you can trust: call him X. If B said ja, X is C. If B said da, X is A.

Question 2: Name that god

Ask X: “If I asked you, are you False, would you answer ja?” Since X is not Random, the table applies. If X answers ja, the statement is true, so X is False. If X answers da, the statement is false, so X is True. You now know one god exactly.

Question 3: Place Random

Ask X again: “If I asked you, is B Random, would you answer ja?” Since X is not Random, ja means yes and da means no. If X answers ja, B is Random, and the third god takes the remaining role. If X answers da, B is not Random, so the third god is Random, and the last role falls to B.

Try a full run through. Suppose B answers ja to question 1, so X is C. Suppose C answers da to question 2, so C is True. Suppose C answers ja to question 3, so B is Random. Then A must be False. You have named all three: A is False, B is Random, C is True.

The Trap Most Candidates Fall Into

The most common error is to spend the first question trying to decode the language. Candidates ask whether da means yes, then cannot use the answer, because they still do not know who answered. Language first is the wrong order. Identity first, through a question that works in either language, is the right order.

The second trap is to fear Random. Candidates avoid god B in question 1 because he might be Random, and they waste the question on a god they already suspect. But the first question is designed for exactly that risk. Random is not a flaw in the plan. Both branches land on a safe god.

The third trap is to answer with a method that needs four questions, or to claim the puzzle is impossible. Three questions are enough, and each one does distinct work: find a safe god, name him, place Random.

What the Interviewer Is Testing in the Hardest Logic Puzzle Answer

This question tests four skills at once. First, it tests whether you can design a question that is robust to two unknowns at once. Second, it tests case analysis: the first question works because you check both branches, Random included, and both branches agree.

Third, it tests elimination discipline. You never need to identify Random directly. You identify one safe god, then you ask him one yes or no question about B, and the third god falls out by elimination. Candidates who try to name all three gods head on usually run out of questions.

Fourth, it tests clear explanation under pressure. The strongest answer starts with the embedded question trick, proves it with the table, and walks through the three questions in order. Say the branch logic out loud for question 1, because that is the step most listeners will doubt.

Quick Answers to Common Questions

Can you solve it in fewer than three questions?

Not within the stated rules. Each question earns one fact: a safe god, his identity, and the place of Random. Two question solutions exist, but they rely on paradox tricks outside these rules, so do not use them in an interview.

Does it matter whether da means yes?

No, and that is the point of the embedded question. For True and False, ja always means the statement is true and da always means it is false, whichever word means yes. You never decode the language, and you never need to.

What if Random answers the first question?

Nothing breaks. If B is Random, his answer is random, but both possible answers still point to a safe god: ja points to C, and da points to A. The plan uses the answer without trusting the speaker, which is why it works.

Try Another Puzzle

If you liked this one, try Cheryl’s birthday puzzle, where three short statements pin down one exact date. Then test yourself on the 100 prisoners boxes puzzle, where a simple chain rule wins about 31 percent of the time, and on the wolf, goat and cabbage puzzle, where one swap in the middle makes the whole crossing work.