Knights & Knaves Puzzles
On this island, knights always tell the truth and knaves always lie. Every islander makes a claim about someone's identity — and from those claims alone you can work out who is who. Sixty boards from three to six islanders, each verified to have exactly one solution, each deduction explained.
Also known as knights and liars puzzles and truth-teller logic, from the island of knights and knaves made famous by Raymond Smullyan.
Truth Is The Only Evidence
A Knights and Knaves puzzle gives a set of islanders and their claims. Every claim is either true (spoken by a knight) or false (spoken by a knave) — and the single assignment of types must make every claim come out exactly that way. There is no hidden state and no luck: the claims are the complete evidence, and one assignment survives them.
How To Solve A Knights And Knaves Puzzle
- List the claims. Who says what about whom. Most chains start here.
- Find an anchor. A claim whose speaker or target is settled by another claim — or a claim that must be true regardless, such as a knight confirming an obvious knight.
- Propagate. Each settled islander settles whoever their claim is about: a knight's claim is true, a knave's claim is false.
- Test what stalls. If two types seem possible for one islander, assume one, follow the chain, and keep the branch that survives every claim.
- Audit at the end. Every claim must agree with the final assignment.
The self-reference trap. No islander can say "I am a knave" — a knave saying it would be telling the truth, and a knight saying it would be lying. Solvable puzzles never contain that claim, and the generator here is built to exclude it.
The Four Island Sizes
| Islanders | Combinations | What it trains |
|---|---|---|
| 3 | 8 | Claim reading and the truth-table habit |
| 4 | 16 | Two-step propagation chains |
| 5 | 32 | Interlocking claims about claims |
| 6 | 64 | Full case analysis without a missed branch |
Why Uniqueness Is The Whole Promise
A Knights and Knaves puzzle only works if exactly one assignment survives the claims. Two survivors mean the evidence is incomplete; zero means the claims contradict each other. Every board on this site is checked by an exhaustive search over all 2^N assignments before it ships — so when the walkthrough ends with "the only one", that is a verified fact, not a promise.
Knights & Knaves Puzzles: Frequently Asked Questions
What is the Knights and Knaves puzzle?
Knights always tell the truth and knaves always lie. Each islander makes a claim about someone's identity or about two islanders being the same or different. From the claims alone you work out every islander's type.
How do you solve Knights and Knaves puzzles?
When an islander's type is known, their claim settles whoever it is about: a knight's claim is true, a knave's claim is false. Chains of claims usually resolve the whole island. When they stall, test the two possible types of one islander and keep the branch that survives every claim.
Can a knave say "I am a knave"?
No. A knave saying it would make the statement true — impossible for a liar. A knight saying it would make it false — also impossible. The contradiction is why this claim never appears in a solvable puzzle.
What is the difference between a knight and a knave?
Only what they do with the truth: a knight's every statement is true, a knave's every statement is false. Their claims can look identical on the surface — which is why you must test each claim against the rules instead of trusting the tone.
How many puzzles are there?
There is no fixed number. Each puzzle is rebuilt from the short seed in the page address, so the supply is effectively unlimited. Copying the puzzle link saves that exact puzzle permanently.
Can I practise one pattern at a time?
Yes. Pick any pattern from the catalogue above and the board switches to that islander count and claim style only, with its own address you can bookmark or hand out.
Are Knights and Knaves puzzles logic puzzles?
Yes — they are Boolean logic in costume. Each claim is a statement about truth values, and solving one is proving which assignment makes every statement consistent. They are widely used to teach propositional reasoning.
Why is the solution always unique on this site?
Every generated board is checked by an exhaustive search over all possible assignments before it ships. Only boards with exactly one consistent assignment are kept — the same verified-unique promise as every other puzzle on PuzzleType.