In the famous
"The Odd Coin" problem you are given twelve coins, exactly one of which is lighter or heavier than the other coins. You are to determine the counterfeit coin, and whether it is lighter or heavier than the other coins, in just three weighings with a balance.
Can you solve this problem with the additional restriction that you must decide what coins go on each pan for all three weighings before any weighing takes place?
(In reply to
re(4): Another way to answer it by McWorter)
Interesting approach using ternary numbers, McWorter... Another advantage to your solution is that you could probably generalize your method to more coins and more weighings (e.g., 36 coins and 4 weighings), and arrive at the correct weighings faster. My solution did require some trial and error before I was able to get 24 different results corresponding to the 24 different possibilities.
re(5): Another way to answer it
