The Defective Coin Problem: An Algorithmic Analysis

Abstract

The defective coin problem involves the identification of a defective coin, if any, and ascertaining the nature of the defect (heavier/lighter) from a set of coins containing at the most one defective coin, using an equal‐arm‐pan‐balance. An algorithmic analysis of the problem is considered. The solution strategy to minimise the number of weighings required to detect the defective coin is based on a problem reduction approach involving successive decomposition of the problem into subproblems until it is trivially solved. The algorithm is capable of generating all possible optimal solutions.

Citation

Ankolekar, S., Das Gupta, A. and Srinivasan, G. (1990), "The Defective Coin Problem: An Algorithmic Analysis", Kybernetes, Vol. 19 No. 5, pp. 44-58. https://doi.org/10.1108/eb005861