Searching for a counterfeit coin with b-balance Original Research Article

We consider the classical problem of searching for a heavier coin in a set of n coins, image of which have the same weight. The weighing device is b-balance which is the generalization of two-arms balance. The minimum numbers of weighings are determined exactly for worst-case sequential algorithm, average-case sequential algorithm, worst-case predetermined algorithm, average-case predetermined algorithm.