Quirky Query Hub playbook · 2 minute read
Three deduction challenges with explicit conditions
Unlike a hidden-context riddle, these examples provide every condition needed. Ask players to state which condition rules out each rejected answer. No real-world trivia or invented exception is required.
- One token is in box A, B or C. Their labels say "The token is in A," "The token is not in A," and "The token is not in C." Exactly one label is true. Where is the token? Answer: C. In A, the first and third labels are true; in B, the second and third are true. Only C makes exactly one label true: the label on B. Hint: test the three locations, not three meanings of true.
- A two-digit code has digits summing to nine. Reversing its digits makes a number twenty-seven smaller. What is the code? Answer: 63. Let the tens digit be a and units b. Reversing changes the value by nine times the difference between a and b, or 9(a-b), so a minus b is three. Combining that with a plus b equals nine gives six and three. Hint: compare place values before trying every pair.
- Three illustrated cards show a moon, a key and a cup. The moon is somewhere before the key; the cup is not last; the key is not in the middle. Do these clues determine a unique order? Answer: no. The key cannot be first because the moon precedes it and cannot be middle by the given rule, so it is last. The remaining two can be cup-moon or moon-cup; both put the cup before last. Therefore there are TWO valid orders, and the correct conclusion is that the clues do not determine a unique answer. Add "the cup is before the moon" to obtain the single order cup-moon-key. Hint: test whether uniqueness was actually promised.
A few good questions
Must every clue set have a unique solution?
No. Test the constraints explicitly. The moon-key-cup example admits two orders until a further condition is supplied.