Logic Puzzles
Truth-tellers/liars, deduction, self-referential statements, ordering puzzles
What you need to know
- Truth-tellers and liars. A truth-teller says only true things; a liar says only false things. So a speaker is a truth-teller exactly when what they say is true. Example: if Kim says "Lee is a liar," then either Kim is truthful and Lee lies, or Kim lies and Lee is truthful. Either way, they are different types.
- "Must be true" means true in every situation that fits the facts given. One counterexample (a situation that fits the facts but breaks the statement) rejects it. Example: "every club member plays chess" does not force "every chess player is in the club": one chess player outside the club breaks it.
- "Some" means at least one, and it allows "all." Example: "some of my pets are dogs" is still true if every pet is a dog.
- "All are " does not mean "all are ." Knowing that something is a tells you nothing about whether it is an . Example: all squares are rectangles, but not all rectangles are squares.
- Nobody can say "I am a liar." A truth-teller saying it would be lying, and a liar saying it would be telling the truth.
- "We are both liars" can only come from a liar whose partner is a truth-teller. A truth-teller can't say it, since it would make the speaker a liar. So the speaker lies, the statement is false, and the two are not both liars: the partner tells the truth.
How AMC 10 tests it
- Rare, usually in positions 5–15, and solved by casework rather than by a formula.
- "Which statements must be true?" with three claims labeled I, II, III. Test tiny made-up worlds, and read "some" literally.
- Truth-teller/liar puzzles where people talk about each other. Find one claim that settles a relationship in both cases, then follow where it leads.
Standard approaches
- First rewrite each sentence as a precise "if ... then ..." statement.
- Find the anchor: a statement that tells you the same thing whether the speaker is a truth-teller or a liar.
- Split into cases on one person's type and follow the consequences. A contradiction rules that case out.
- For "must be true," build the smallest world that fits the facts and see which statements fail.
Worked example
Ava, Ben, Cal, and Dee are each either a truth-teller or a liar. Ava says, "Ben and Cal are both liars." Ben says, "Exactly one of Ava and Dee is a liar." Cal says, "Dee is a truth-teller." Dee says, "Ava is a liar." How many of the four are truth-tellers?
(A) (B) (C) (D) (E)
Start with Dee, the anchor. If Dee tells the truth, Ava is a liar. If Dee lies, Ava is a truth-teller. In both cases Ava and Dee are different types, so exactly one of them is a liar.
Ben. That is Ben's claim, so Ben is a truth-teller.
Ava. Ava said Ben and Cal are both liars. Ben is not, so Ava's statement is false and Ava is a liar.
Dee and Cal. Since Ava is a liar, Dee's statement is true, so Dee is a truth-teller. Then Cal's statement about Dee is true, so Cal is a truth-teller too.
So the truth-tellers are Ben, Cal, and Dee. The answer is .
Pitfalls
- Reading "some are " as "some but not all," or turning "all are " around into "all are ."
- Stopping at one assignment that works without checking that the other cases fail.
- Thinking that when a liar joins two claims with "and," both are false. You only know that at least one is false: a liar who says "I have a cat and a dog" might have a cat.
- Using real-world facts that the problem never states.
Traps that recur
- Starting from red 1 (which fits anywhere) rather than from the most restricted cards, and getting lost in possibilities. (2003 AMC 10A #24)
- Assuming all alternaters answer alike; those who start truthful say no three times, those who start lying say yes three times. (2022 AMC 10A #12)
- Assigning Aditi 3 + 4 = 7 before noticing that Oscar's score of 4 already requires cards 1 and 3. (2021 AMC 10B #17)
- Assuming Ada must return to seat 5 (the right end) or forgetting that Dee and Edie's swap contributes zero net movement. (2016 AMC 10A #13)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.