Problem #PRU-35797

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

In one urn there are two white balls, in another two black ones, in the third – one white and one black. On each urn there was a sign indicating its contents: WW, BB, WB. Someone rehung the signs so that now each sign indicating the contents of the urn is incorrect. It is possible to remove a ball from any urn without looking into it. What is the minimum number of removals required to determine the composition of all three urns?