Welcome to Binary Search Hunt!
A hidden treasure is located somewhere in the sorted grid. The grid is sorted sequentially (1, 2, 3...).
The Rule of Binary Search
Instead of guessing randomly, guess the middle of the remaining possibilities. Each time you guess, the game tells you if the treasure is higher or lower.
- Click a cell to guess.
- Eliminated cells will fade out. Focus on the bright ones!
- Try to find it in fewer steps than the Optimal Max!
Why the Optimal Max? Using binary search on N items takes at most ⌈log₂(N)⌉ steps, since we eliminate half the items every guess!