I'd seen this puzzle before and that almost made it worse because I half-remembered a solution and kept second-guessing myself.
Start by explaining the information-theoretic bound: 3 weighings yield 27 outcomes, enough to distinguish 24 possibilities (12 coins × 2 weight states). Then describe a systematic strategy: first weighing 1-4 vs 5-8, and branch based on the result, using the remaining weighings to isolate the counterfeit and determine its weight. Walk through the decision tree clearly, using notation like 'if left heavy' and 'if balanced'.
Pro tip: Mention that the problem is equivalent to coding each coin with a unique ternary code (e.g., L, R, or off) such that no code is the negative of another, and each weighing corresponds to a digit. This shows deep understanding and can simplify the explanation.
Explain that 3 weighings have 3^3 = 27 possible outcomes, and there are 24 possibilities (12 coins × 2 weight states), so it's theoretically possible. This sets the stage and shows you understand the constraints.
Weigh coins 1-4 against 5-8. If balanced, the counterfeit is among 9-12; if left heavy, it's among 1-8 with specific implications; if right heavy, similarly. This splits the problem into manageable cases.
For each case, design a second weighing that further narrows down the possibilities. For example, if first weighing balanced, weigh 9,10,11 vs 1,2,3 (known genuine). If first weighing unbalanced, use a more complex weighing involving some coins from the heavy side and some from the light side.
Based on the outcomes of the first two weighings, perform a final weighing that distinguishes between the remaining candidates and determines whether the counterfeit is heavy or light.
Clearly present all branches and outcomes, ensuring that every possible scenario leads to a unique identification of the counterfeit coin and its weight status.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.