Given the numbers 1 to 1000, what is the minimum numbers guesses needed to find a specific number if you are given the hint "higher" or "lower" for each guess you make? I realize the answer for this particular question is technically 1 if you guess right first off but is there a "general" expected minimum?


  • 1
    $\begingroup$ binary search problem, probably a duplicate. $\endgroup$
    – Oray
    Commented Sep 7, 2017 at 18:50
  • $\begingroup$ The problem is actually about finding the "maximum minimum". As in: In the worst case scenario, what is the least number of guesses you need? $\endgroup$ Commented Sep 8, 2017 at 19:01


Browse other questions tagged or ask your own question.