Theoretical Computer ScienceVolume 95, Issue 2, 30 March 1992, Pages 307-321Mathematical GamesUlam's searching game with a fixed number of liesAuthor links open overlay panelJoel SpencerShow moreShareCitehttps://doi.org/10.1016/0304-3975(92)90270-PGet rights and contentUnder a Creative Commons licenseopen archiveAbstractPaul tries to find an unknown x from l to n by asking q Yes-No questions. In response Carole may lie up to k times. For k fixed and n, q sufficiently large, necessary and sufficient conditions are given for Paul to win.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1992 Published by Elsevier B.V.
