The Binary Decoder Game is a five-round keyboard challenge in which four binary digits (a base-two positional code made of only 0s and 1s) must be converted into their decimal (base-ten) value before a second wrong answer ends the run. Each round shows exactly four bits and asks for the matching number from 0 through 15, so every answer fits on the keyboard with at most two digits. The conversion rule itself is the same one used everywhere binary is read: from left to right, each position holds 8, 4, 2, and 1 in turn, and only the places that contain a 1 are added together. That single rule covers the whole game, because the five rounds are fixed and known up front, and the points awarded per correct round are also fixed at 200. Players who can read a four-bit code at a glance can clear the game at the documented perfect score of 1,000 points, while a single mistake clears the entry and lets you try again until you have made two errors.
The Five Fixed Codes at a Glance
The Binary Decoder Game does not pick random codes; it walks through five fixed four-bit values in order. Every one of them converts to a single integer between 1 and 15, so the answer always fits on the keyboard as one or two digits and never requires a third digit of input.
| Round | Code | Place values with a 1 | Decimal answer |
|---|---|---|---|
| 1 | 0001 | 1 | 1 |
| 2 | 0011 | 2 + 1 | 3 |
| 3 | 0110 | 4 + 2 | 6 |
| 4 | 1010 | 8 + 2 | 10 |
| 5 | 1111 | 8 + 4 + 2 + 1 | 15 |
Because the codes are documented, the full winning route is reproducible. A clean run that decodes 0001, 0011, 0110, 1010, and 1111 in that order passes every check the game performs and ends on the displayed 1,000-point maximum.
How to Play Binary Decoder Game
The full rule set fits on one screen, and every action happens locally in the browser. To get the perfect score on the Binary Decoder Game rules page, follow this exact sequence.
- Read the four binary digits using place values 8, 4, 2, and 1 from left to right. Treat each 1 as "include that place" and each 0 as "skip that place," then sum the included places to get the decimal answer.
- Type the decimal result on the keyboard, use Backspace or Delete if you need to fix a digit, and press Enter to submit. Answers can be one or two digits because every challenge value sits in the 0-to-15 range.
- Decode 0001, 0011, 0110, 1010, and 1111 before you make a second mistake. Each correct submission awards 200 points and advances immediately to the next round.
If you are using a mouse or a touchscreen instead of the keyboard, tap the ten on-screen digit buttons to build the answer and press the Submit decimal button. There is no pointer-only mode, so a keyboard or the digit buttons are both valid ways to interact.
Worked Example: Reading 1010
The fourth round is the one most new players second-guess, because it reads "ten" even though there is no 1 in the units place. The conversion follows the place-value rule from left to right, and every step is shown below.
Reading the bits against the place values 8, 4, 2, and 1:
- The first bit is 1, so add 8. Running total: 8.
- The second bit is 0, so add 0. Running total: 8.
- The third bit is 1, so add 2. Running total: 10.
- The fourth bit is 0, so add 0. Running total: 10.
Type 1, then 0, then press Enter. The 200-point award appears and the next round (1111) replaces the code. The same fold-left pattern handles every other code in the game, including 1111, which sums 8 + 4 + 2 + 1 to 15.
How the 1,000-Point Score Works
Scoring is intentionally simple: each correct answer is worth 200 points, and there are exactly five rounds. The arithmetic is 200 + 200 + 200 + 200 + 200 = 1,000, and the game's contract states that the clean key 1, 3, 6, 10, 15 finishes all five rounds at exactly 1,000 points. The best score from a completed run is stored only in localStorage, so it stays on the same browser and device. There is no server-side high score, no account, and no network request, because everything, including score tracking, runs locally in the browser.
The score is monotone-increasing during a run: it never decreases, even after a wrong answer. Mistakes affect only the remaining "lives," not the points already banked, which means a player who has already earned 600 points can still finish at 1,000 if they decode the last two rounds correctly.
What Happens After a Wrong Answer
The Binary Decoder Game treats mistakes as recoverable for exactly one round. The first wrong submission clears your current entry, leaves the same code on screen, and lets you try again immediately. The run only ends when a second wrong answer is submitted against any code, because the contract specifies that "a second wrong submission creates a terminal deadlock and disables further progress until Restart."
That terminal state is not a fail screen in the usual sense. The code remains visible, the score remains visible, and the input simply stops accepting entries. Press Restart to return to the first round (0001) with an empty answer, zero points, and zero mistakes, then start the run over. The restart path is the only way out of a deadlocked run; there is no way to skip a round, edit a previous answer, or carry partial credit into a restarted attempt.
Controls, Input Limits, and the Boss Key
The interface is intentionally minimal. The binary code is rendered as large monospaced text, and the decimal entry has an accessible label so screen readers announce what you are typing into. The keyboard accepts only decimal digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. Non-digit keys are ignored, and any string that contains a character outside that set will not register at all.
The two-digit cap is enforced by the input length itself: the disclosed answer range is 0 to 15, so the longest possible answer is two characters. Backspace and Delete both remove the last digit from the entry. Enter submits; pressing Enter on an empty entry does nothing, and pressing Enter on a full two-digit entry submits that entry. Mouse and touch users have a parallel path through the ten digit buttons plus a Submit decimal button, which makes the same rules available to anyone who does not want to use the physical keyboard.
The Boss Key is a hidden gesture: double-press Escape to swap the screen for a shared simulated spreadsheet, and double-press Escape again to return to the current code. The current score and round are preserved across the gesture, so it does not count as a restart or a pause. There is no audio, no timer, and no canvas. The game is purely text, buttons, and site CSS variables, which is why the controls behave the same on every modern browser.
The Math Behind Base Two
The conversion rule used by the Binary Decoder Game is the same one that NIST IR 8354 documents for digital data representation: binary is a positional numeral system with a radix (base) of two, which means each new position to the left doubles the place value and contributes either zero or one to the total. Reading from left to right, you fold the value with value = value × 2 + bit, starting at zero. The MDN documentation for parseInt() independently confirms that a digit such as 2 is invalid in a binary numeral, which is why the decoder function rejects any input that contains a non-0, non-1 character rather than silently accepting a prefix.
Practice More Number Challenges
The Binary Decoder Game is one of several compact keyboard-driven number challenges on the site. Players who enjoy reading place values often move on to the Binairo rules and solving steps guide, which also uses zeros and ones as its only symbols but applies them in a 6 by 6 grid. Players who like the fixed-route, mistake-limited format can compare it with the Addition Maze route to exactly 19, where the rule is to pick a path of cells that add up to a fixed target without going over.