The solution of a problem of Ulam on searching with lies

Abstract

We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 2/sup 20/ if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e.