No — the five codes in the four-bit binary game are completely fixed and reproducible, never random. Every session shows the same four-bit values in the same order: 0001, 0011, 0110, 1010, and 1111. Because the codes never change, any player who decodes them all correctly will always reach the same 1,000-point total. This design is deliberate. The game is a practice tool for base-two place values, not an adaptive quiz or a randomized test. Fixed codes mean you can audit the entire path, replay a failed run, and learn from any mistake you make. They also mean a teacher can show the exact five prompts to a class and know every student sees the same questions. The five values were chosen to span the four-bit decimal range from 1 to 15 and to mix common patterns: an all-ones code, an alternating code, an even code, and the textbook 1010 example. From your first attempt to your fiftieth, the codes you see today will be the codes you see tomorrow.
Why the Codes Are Not Random
The four-bit binary game is built around five immutable four-bit rounds. Its implementation stores these five codes as constants and checks your typed decimal against the fixed mapping: 0001 → 1, 0011 → 3, 0110 → 6, 1010 → 10, and 1111 → 15. There is no shuffle, no pseudo-random selection, and no adaptive difficulty curve inside the run. This makes the entire game a deterministic challenge: the same input always produces the same score path.
For a player, this has two practical effects. First, you can study the codes in advance and know exactly what to expect. Second, two players running the game back-to-back under the same conditions will always see identical prompts in identical order. The sequence is not seeded by time, browser, or session, and the game does not claim to be a random test, an adaptive assessment, or a standardized examination, so reproducibility is a feature rather than a limitation. If you have ever wondered whether a luckier random sequence could push you toward a perfect score, the answer is no — the sequence you see is the sequence everyone sees.
The Five Fixed Codes and Their Decimal Values
Each four-bit code is a string of four binary digits, and each one maps to a single decimal answer between 1 and 15. The five values were selected to include a mix of patterns: a single one, two adjacent ones, alternating bits, an even value with two separated ones, and the all-ones maximum. Memorizing this table is the entire preparation you need before a run.
| Binary code | Decimal value | Pattern note |
|---|---|---|
| 0001 | 1 | Single trailing 1, only the units place is set |
| 0011 | 3 | Two trailing 1s, both the 2 and 1 places set |
| 0110 | 6 | Alternating bits, the 4 and 2 places set |
| 1010 | 10 | Outer bits set, the 8 and 2 places set |
| 1111 | 15 | All bits set, the maximum four-bit value |
How the Five-Round Run Plays Out
A run starts on 0001 with an empty answer field, zero points, and zero mistakes. Each correct submission awards 200 points and immediately advances to the next code. Decoding 0001 lands you on 0011. Decoding 0011 lands you on 0110. The chain continues through 1010 and ends on 1111. Solving all five codes in order produces exactly 1,000 points, since 5 × 200 = 1,000. There is no bonus for finishing quickly, no penalty for taking longer, and no score variation based on speed.
Because the codes never change, the perfect route is always 1 → 3 → 6 → 10 → 15. Two wrong answers end the run. After the first mistake, the entry clears and the same code remains visible, so the first slip is recoverable. A second wrong submission deadlocks the input and disables further progress until you Restart. Restart resets the field to 0001, clears the score to zero, and zeroes out the mistake count, giving you a fresh attempt on the same five codes. A completed best score is preserved only in localStorage on your own browser, so it is reproducible on the same device but not shared across devices or accounts.
Reading the Four Bits Step by Step
Every round of the Binary Decoder Game follows the same three-step workflow. Working through them once gives you the entire technique needed to clear all five fixed rounds.
- Read the four binary digits using place values 8, 4, 2, and 1 from left to right. Each position doubles as you move right, so the leftmost bit is worth 8, then 4, then 2, and the rightmost bit is worth 1. A 1 in a position adds that place value; a 0 in a position adds nothing.
- Type the decimal result, use Backspace if needed, and press Enter to submit. Every answer fits in the disclosed 0-to-15 range, so the entry accepts at most two decimal digits. Backspace or Delete removes the last character, and Enter commits your answer for that round.
- Decode 0001, 0011, 0110, 1010, and 1111 before a second mistake to score 1,000. Because the five codes are fixed, the canonical clean run is always the same: answer 1, then 3, then 6, then 10, then 15.
The single worked example most readers ask about is 1010. Applying place values 8, 4, 2, 1 from left to right gives 1 × 8 + 0 × 4 + 1 × 2 + 0 × 1 = 8 + 2 = 10. The set places are 8 and 2, and they sum to ten. The four-bit positional system follows the same rule for any code you see, and NIST IR 8354 treats these four-bit groupings as the standard way to express values from 0 to 15 in binary.
Score Rules, Mistakes, and Restart Behavior
Each correct answer adds exactly 200 points to your total. There is no partial credit and no per-round multiplier. A clean run through all five codes therefore scores 200 × 5 = 1,000 points every time. The score is purely a function of how many of the five fixed codes you decoded correctly before your second mistake, and the formula holds because the challenge order is itself fixed.
Mistakes are tracked individually. The first wrong submission only clears the entry box and leaves the same code visible, so you can re-enter the correct decimal value and continue. The second wrong submission on the same run ends the run with a terminal deadlock. Input is frozen, scoring is frozen, and the only way to start a new attempt is to Restart, which resets the visible code to 0001, the entry to empty, the score to zero, and the mistake count to zero. The five codes themselves are not changed by Restart, so a new run starts the same fixed sequence every time.
The double-Escape gesture activates a shared simulated spreadsheet boss screen that hides the current puzzle, and repeating the gesture restores the same code you were on. None of the controls depend on a timer, audio, mouse-only input, network request, or hardware permission, and the conversion is checked against externally declared expected values rather than computed against an internal guess.
What Fixed Codes Mean for Your Practice
Reproducibility is useful in three concrete ways. First, learners can drill the exact same five prompts until the place-value method feels automatic. Because 0001, 0011, 0110, 1010, and 1111 cover single-bit, adjacent-bit, alternating-bit, even, and all-ones patterns, mastering these five prompts covers most of the recognition shortcuts you need for any four-bit value from 0 to 15. Second, a teacher can stand in front of a class and reproduce the exact run that a student attempted, then walk through any wrong answer without ambiguity about which code produced the slip. Third, anyone auditing the score can verify the 1,000-point result without guessing which codes were shown, because every code in the route is publicly disclosed.
Fixed codes do mean that, once you have memorized the five answers, a perfect run becomes a typing exercise rather than a thinking exercise. Treat the game as a transparent baseline for binary place values rather than as a randomized challenge, and use it to confirm your understanding of positional base-two notation rather than to test your luck. For adjacent practice with different number puzzles, the deterministic design pairs naturally with tools that test arithmetic, sequences, or pattern recognition in equally fixed formats, so the four-bit binary game fits comfortably into a study plan built around reproducible prompts.