A simple solution to Ulam's liar game with one lie
From MaRDI portal
Publication:952012
Abstract: Ulam asked for the maximum number of questions required to determine an integer between one and one million by asking questions whose answer is `Yes' or `No' and where one untruthful answer is allowed. Pelc showed that the number of questions required is 25. Here we give a simple proof of this result.
Recommendations
Cites work
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 782050 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- Coping with errors in binary search procedures
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Guess a Number-with Lying
- Searching games with errors -- fifty years of coping with liars
- Solution of Ulam's problem on searching with a lie
- Ulam's searching game with a fixed number of lies
Cited in
(10)- Ulam's searching game with a fixed number of lies
- Liar!
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie
- scientific article; zbMATH DE number 512984 (Why is no real title available?)
- Solution of Ulam's problem on searching with a lie
- The Interval Liar Game
- Guess a Number-with Lying
- Ulam's pathological liar game with one half-lie
- How to play the one-lie Rényi-Ulam game
- Ulam's liar problem
This page was built for publication: A simple solution to Ulam's liar game with one lie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952012)
