Loading Assets...
Please rotate your device to landscape mode.
Crack vaults with higher-or-lower guesses in this free online binary search game about logarithms, information theory and beating the log2 curve.
Binary Bandit is a binary search game dressed up as a vault-cracking game show. Each vault hides a secret number inside a range, and your only tool is the higher-or-lower clue the host calls after every dial. Because every answer deletes roughly half the remaining suspects, the fewest possible guesses always traces the same golden curve: log2 of the range size.
Every mechanic maps to real computer science. The shrinking brass rail is the search interval in binary search, the algorithm that finds a value in a sorted list by probing the middle element and discarding the half that cannot contain it. The dial budget mirrors worst-case running time: ceil(log2(n)) probes, so 1024 doors need at most 10 guesses where a linear search might need all 1024. The counter-heist rounds flip the perspective and reveal the flip side of information theory: since every answer is one bit, a range of n numbers needs at least log2(n) bits to pin down a secret, which is why numbers at the edges take the mid-probing droid longest to find.
This is exactly the math that powers modern computing. Binary search sits inside database indexes, version control bisection tools like git bisect and every "guess the number" warmup in programming classes. Shannon's bit, defined in his 1948 information theory paper, is the same unit the game counts on the ledger: one yes-or-no answer, one bit, half the suspects gone. Once the curve is internalized, you hold a reusable intuition for why logarithms make trillion-row databases searchable in microseconds.
Grade Level: Middle School, High School
Explore more free science games at Science Games Lab