The Binary Decoder Game is a keyboard-friendly five-round challenge in which you read a string of four binary digits and type the matching decimal number before the run ends. Each round displays four bits that you interpret using base-two place values of 8, 4, 2, and 1, then enter the resulting value from 0 through 15 and press Enter. A correct answer adds 200 points and advances to the next fixed code, while a wrong answer clears your entry but leaves the same code on screen so you can try again. The complete run finishes at exactly 1,000 points when you decode 0001, 0011, 0110, 1010, and 1111 in order, and the run locks after a second mistake until you restart. Everything runs locally in the browser with semantic text and buttons, no canvas, no audio, and no server connection, so the only thing that decides your score is how quickly you can read each 4-bit code.
What the Binary Decoder Game Is
The Binary Decoder Game is a fixed practice tool for base-two place values. The board shows one four-bit string at a time, rendered as large monospaced text, and the same screen holds the decimal entry field, the running score, and the mistake counter. Every challenge fits inside the disclosed 0-to-15 range, so any answer you can possibly type is at most two digits long. The game does not behave like a random quiz, an adaptive test, or a standardized examination; the same five codes appear in the same order every run, which keeps the winning route, the failure path, and the maximum score fully reproducible.
Because the rounds are immutable, the only variable is how fast and accurately you read each code. There is no countdown timer, no audio cue, and no hidden animation, so you can take as long as you need to think through place values before you submit. The tool is also offline by design: nothing is fetched from a network, nothing is uploaded, and the only persistent state is your best score in the browser's localStorage. Restart clears that temporary state back to zero and reloads the first round, so each fresh attempt starts from the exact same baseline.
How to Play Binary Decoder Game
- Read the four binary digits on screen using place values 8, 4, 2, and 1 from left to right. For example, 1010 reads as 8, 0, 2, 0.
- Type the decimal result into the answer field using the keyboard. If you make a typo, press Backspace or Delete to remove the last digit before submitting.
- Press Enter to submit your answer. A correct entry advances immediately to the next round and adds 200 points; a wrong entry clears the field but leaves the same binary code visible so you can try again.
- Repeat the read, type, and Enter sequence across the five fixed rounds: 0001, 0011, 0110, 1010, and 1111, in that order.
- Decode all five before making a second mistake to land on the exact 1,000-point finish. If you submit two wrong answers, the run locks and the only recovery is Restart.
Each round follows the same three actions, so once you have answered the first code correctly the rest of the run is a matter of rhythm. The decimal entry has an accessible label, and the Submit decimal button is the click equivalent of pressing Enter for mouse and touch users.
Reading 4-Bit Binary with Place Values 8, 4, 2, 1
Binary is a positional number system with radix two, and reading a four-bit string is a matter of multiplying each digit by its place value. Going from left to right, the four columns carry weights of 8, 4, 2, and 1, and you add together only the columns that hold a 1. NIST IR 8354, the National Institute of Standards and Technology reference on digital data representation, describes binary digits and base two in exactly that way. MDN's documentation for parseInt() with a radix argument independently confirms that a digit such as 2 is invalid in a binary numeral, which is why the decoder rejects strings that contain anything other than 0 and 1.
Worked example using 1010: the set places are the 8-column and the 2-column, so 8 + 2 = 10. That single calculation covers the fourth round of the game and is the same shortcut you can apply to every code on screen. As another quick check, 1111 lights up every column, so 8 + 4 + 2 + 1 = 15, which is the highest decimal value the game will ever ask for. Because the maximum is 15, the answer field never needs more than two decimal digits, and the tool enforces that limit automatically.
| Round | Binary code | Set places | 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 |
You can read this table in either direction: from the binary side, sum the place values; from the decimal side, decide which columns must contain a 1. The fixed sequence 1, 3, 6, 10, 15 is the complete winning route, and the running total of those five numbers is 35, which is also the sum of every decimal answer you will type during a perfect run.
Scoring, Mistakes, and the 1,000-Point Path
Every correct submission adds exactly 200 points, and five correct submissions add up to 1,000. That single clean key of 1, 3, 6, 10, 15 is the only path to the maximum score, and because the rounds never change, the perfect run is identical every time you play. The score is visible on the same screen as the current code, so you always know how many rounds remain and how close you are to 1,000.
The mistake counter is forgiving in a specific way. A wrong answer clears the entry but keeps the same code on screen, so the first slip is recoverable. The run only ends after a second wrong submission, at which point the interface enters a terminal deadlock: no further progress is possible until you press Restart. Restart sends you back to 0001 with an empty answer field, zero points, and zero mistakes, which means a fresh attempt is always one click away. Your best completed score stays in the browser's localStorage, so you can close the tab and return later without losing your record.
Because the score increases by a fixed amount each round, you can pace yourself: four rounds correctly answered guarantees at least 800 points even if the fifth slips, and three rounds gives 600. The worst-case run that still produces a usable score is to decode the first four codes correctly, miss the fifth, and use Restart to set up the next attempt with full knowledge of the final code.
Keyboard, Mouse, Restart, and Boss Key Controls
The game accepts input through either the keyboard or the on-screen buttons, and the two paths produce identical results. Keyboard players type the decimal digits 0 through 9 directly into the answer field, use Backspace or Delete to remove the last digit, and press Enter to submit. Mouse and touch users can tap the ten digit buttons and the Submit decimal button for the same effect. There is no pointer-only interaction; everything on screen is also reachable from the keyboard.
| Action | Keyboard | Mouse or Touch |
|---|---|---|
| Enter digits | Type 0 through 9 | Tap digit buttons |
| Delete last digit | Backspace or Delete | Press Backspace key |
| Submit answer | Enter | Tap Submit decimal |
| Restart run | Restart control | Tap Restart |
| Hide screen | Double-press Escape | Double-press Escape |
Beyond the basic controls, two extra gestures handle interruptions. Restart returns the run to the first code with a clean slate, useful after a mistake you do not want to nurse through to a deadlock. Double-press Escape opens a shared simulated spreadsheet boss screen, and repeating the same double-press returns to the current binary code, which is handy if you are playing in a shared space and need to clear the screen quickly. Neither gesture alters the score or the round, so they are safe to use mid-run.
For adjacent practice that uses similar keyboard-friendly number play, the Number Sequence Quiz and Number Fill-In puzzles on Lizely follow the same local, no-account philosophy, as do the Magic Square and Math Maze titles. For the rules and decoding strategy behind this exact game, see the Binary Decoder Game Rules guide.