Optimal comparison strategies in Ulam's searching game with two errors

Suppose x is an n-bit integer. By a comparison question we mean a question of the form ''does x satisfy either condition a less than or equal to x less than or equal to b or c less than or equal to x less than or equal to d?''. We describe strategies to find x using the smallest possible number q(n) of comparison questions, and allowing up to two of the answers to be erroneous. As proved in this self-contained paper, with the exception of n=2, q(n) is the smallest number q satisfying Berlekamp's inequality 2(q) greater than or equal to 2(n) ((q/2) + q + 1). This result would disappear if we only allowed questions of the form ''does x satisfy the condition a less than or equal to x less than or equal to b?''. Since no strategy can find the unknown x is an element of {0, 1,...,2(n)-1) with less than q(n) questions, our result provides extremely simple optimal searching strategies far Ulam's game with two lies - the game of Twenty Questions where up to two of the answers may be erroneous.