Solution of Ulamʹs searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes Original Research Article

In this paper we determine the minimal number of yes–no queries that are needed to find an unknown integer between 1 and N, if at most three of the answers are lies. This strategy is also an optimal adaptive strategy for binary three-error-correcting codes.