Binary Search Strategy
The mathematical way to guarantee you'll guess any number 1-100 in 7 questions or less.
How Binary Search Works
Binary search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item.
💡 The Math Behind It
With 100 numbers, you can eliminate half each time: 100 → 50 → 25 → 13 → 7 → 4 → 2 → 1. That's 7 questions maximum to find any number!
Step-by-Step Example
- Q1: "Is it greater than 50?" (If yes, target is 51-100)
- Q2: "Is it greater than 75?" (If yes, target is 76-100)
- Q3: "Is it greater than 87?" (If yes, target is 88-100)
- Continue halving until you isolate the exact number
Practice Makes Perfect
Start with smaller ranges (1-10, then 1-50) to build intuition. Once you understand the pattern, applying it to the full 1-100 range becomes automatic.
▶ Play Guess The Number Game