… The main objective of the present paper is to give a solution of Ulam’s problem for two lies,
in the case when the search space has size 2”. We show that it is then possible to determine …

… We also give an algorithm to perform the search using this … following the formulation of
Ulam’s original question. We do … We shall consider the task of searching in terms of a game …

… variations of Ulam’s game, such as that in which the proportion of lies told at any point must
… our solution of Ulam's problem. Consider a game played by two players, the Responder who …

… We define an e-lie game to be one in which up to e lies can be told. We let f(n, e) denote the
… in the e-lie game with n possible objects. At any given stage of an e-lie game, let Xi be the …

… Deppe, Solution of Ulam’s searching game with three lies or an optimal adaptive strategy
for binary three-error-correcting codes, Discrete Math. 224 (1–3) (2000) 79–98. [6] C. …

… In this section we consider variants of the RÃenyi–Ulam game in which the limitation of
lies is different from imposing a fixed upper bound on their number during the entire …

… 2” - 1) with less than q(n) questions, our result provides extremely simple optimal searching
strategies for Ulam’s game with two lies - the game of Twenty Questions where up to two of …

… , “Ulam’s searching game with lies” (first submitted in March 1986), where the authors solve
the general Ulam … sufficient to find a number between I and 2”, if up to two lies are allowed. …

… The following theorem summarizes all it is known about shortest search strategies for the
Ulam-Rényi game with e lies and q-ary questions over an arbitrary d-regular channel. …

… In the present paper we give a solution of Ulam’s problem for three lies, when the search
space has size 2”‘. We show that, for m = 1, m = 4, and m 2 6, the unknown number can be …