Omniadisce

One Question, One Guard: Two Doors, Three Guards

Multiple choice Beginner New no attempts yet
You are in a room with two doors and three guards (A, B, C). Exactly one door is safe to leave by.

Each guard is either a $\textbf{knight}$, who always tells the truth, or a $\textbf{knave}$, who always lies. The guards all know which door is safe and the true identities of all the guards.

You are allowed to ask a single question, to a single guard, and that question may refer to another guard by name. It must be a question that can be answered yes or no. Before you can speak, the guards announce:

$\textbf{A:}$ "Exactly two of us are knaves."


Principles it rests on
  • Exhaustive Enumeration: A truth-teller puzzle is settled by listing every arrangement consistent with the claims and then keeping only those in which each knight's statement is true and each knave's is false.
  • Forced Structure: What the surviving arrangements share is the usable fact. Here it is whether two named guards must be the same type, whatever else remains unknown.
  • Lying About a Lie: A question of the form \"would $X$ say yes?\" put to a knave inverts $X$'s answer, so two lies cancel -- provided the two guards are known to be the same type.
  • Counting Answers: One yes-or-no answer has two values, so it can never tell more than two possibilities apart, whoever is asked.
Question
Is it possible to identify the safe door with that one question?
Nobody has tried this yet.Be the first. Your answer starts the stats.

Only each person's first answer, given before viewing the solution, is counted.

Discussion 0 comments

Log in to join the discussion.

× Enlarged view