How to Make a Binary Puzzle With One Solution

Set the target before you hide any cells

To make a binary puzzle, you need two different grids: a completed answer and a smaller set of fixed clues for someone else to solve. A valid answer is only the starting point. If your clues also fit a second valid answer, the puzzle is ambiguous, even if the answer you wrote down looks perfect.

Use a 6x6 board for a first attempt. Every finished row and column must contain three 0s and three 1s, no line may contain 000 or 111, and all six rows must differ from one another, as must all six columns. Label rows 1 to 6 and columns 1 to 6 before you begin. Coordinates such as R1C6 will make clue changes and answer checks unambiguous.

• Check the three Binary Puzzle rules

Begin with a checked 6x6 answer grid

Copy the completed grid below onto a private answer sheet. It has six different balanced rows. Reading downward, its columns are 101010, 010110, 011001, 100101, 110010, and 001101. Those six patterns are also balanced, free of triples, and distinct. Checking both directions matters: six legal rows can still produce an illegal column.

For your own design, fill one row with three of each digit and no triple. Add a different valid row, then check each growing column before adding the next. At the end, compare the complete columns for repeats. Do this before erasing clues; removing a number cannot repair an invalid finished answer.

Remove clues one cell at a time

Start with all 36 answer cells visible. Erase one digit, count the solutions still compatible with the remaining clues, and keep the erasure only if the count stays at one. Repeat. You can remove clues in any order, but test after every removal. Keeping a pencil mark beside each tested coordinate saves time if you later restore a clue.

Here is a 15-clue puzzle made from the answer above. A dot means an empty cell; every printed 0 or 1 is a fixed clue. In its 16-clue draft, R1C1 was also a fixed 1. Removing that 1 left exactly one solution, so the final grid leaves R1C1 blank. Copy only this grid if you want someone to solve it without seeing the answer.

The spread of clues is intentional. Rows 3, 4, and 6 each have just two givens, while rows 1, 2, and 5 offer early deductions. A perfectly even clue count per row is unnecessary; what matters is the resulting solution count and a readable path through the puzzle.

See why R1C6 must stay on the sheet

Now try erasing the 0 at R1C6 from that 15-clue puzzle. The resulting 14-clue grid has exactly two valid completions. One is the intended answer shown earlier. The other is printed below. Both satisfy every remaining clue and all three rules, so finding your intended answer first would not prove uniqueness.

In the alternative, row 1 becomes 100101 instead of 100110. Rows 3 and 6 change too, while rows 2, 4, and 5 remain as before. Replacing the 0 at R1C6 rules out this alternative and restores a single answer. This is the practical test for an essential clue: without it, you can exhibit another complete legal grid.

Count possible answers, not just the first answer

You can check a 6x6 design by hand. Of the 64 possible six-digit binary rows, only 14 contain three 0s, three 1s, and no triple: 001011, 001101, 010011, 010101, 010110, 011001, 011010, 100101, 100110, 101001, 101010, 101100, 110010, and 110100. Copy that list beside your draft as a row-pattern key.

Cross out any pattern that disagrees with a given in each row. For the 15-clue puzzle, row 1 has only 100110 available; row 2 has only 011010. Row 3 still allows 100101, 101001, 101100, or 110100. Try each surviving row pattern, reject duplicate rows, and check the columns as you extend the grid. Reject a branch as soon as a column develops a triple or cannot reach three of each digit. At six rows, reject duplicate columns too.

Finding two completed boards is enough to reject an erasure. Proving one solution takes more work: every other candidate branch must fail. If manual enumeration becomes unwieldy, keep another clue or use a trustworthy solver that explicitly counts solutions under these exact three rules. A checker that merely says your preferred answer is valid does not perform this test.

Test whether a person can find a sensible first move

Uniqueness and approachability are separate checks. Cover the answer sheet and solve only from the printed clues. In row 1, the adjacent 0s at C2 and C3 force C4 to be 1; another 0 there would make 000. That row already has three 0s, at C2, C3, and C6, so C1 and C5 must also be 1. You have recovered 100110 without guessing.

Row 2 begins with 1s at C2, C3, and C5. Its three empty cells must be 0, giving 011010. After each solved row, look down the crossing columns before scanning another row. If your test solver gets stuck, record the exact point of uncertainty. Restore a clue that opens a deduction, then recount solutions and try the sheet again. Removing more clues simply to make the page look harder often makes it less pleasant to solve.

• Use a step-by-step solving method

Make a clean puzzle and answer copy

On the handout, show the 15-clue grid, the three rules, and row and column labels. Keep the completed answer on a separate page. Darken fixed digits so players can distinguish them from pencil entries, and use a centered dot or an empty square for each blank. Do not print a 0 where you mean a blank.

Before sharing it, compare all 15 printed givens against the answer sheet by coordinate. A single copying error can turn a uniquely solvable puzzle into an impossible one. If you want to practice solving before making another sheet, use a fresh 6x6 game; it generates a different puzzle rather than loading this handmade grid.

• Practice on a fresh 6x6 Binary Puzzle

Avoid three common construction errors

First, do not stop after checking that every printed clue matches your answer. That proves the intended answer is possible, but the 14-clue example shows why a second answer may still exist. Count completions after each erasure.

Second, compare whole rows only with other rows, and whole columns only with other columns. A row is allowed to match a column; the uniqueness rule operates separately in each direction. Rejecting a valid answer because a row resembles a column would make the check stricter than the puzzle rules.

Third, avoid treating the fewest possible clues as the goal. A clue can be redundant for uniqueness yet helpful for a fair opening. Decide whether your sheet is for a beginner or a patient pattern hunter, then keep the clues that support that experience. Record which clues you removed so you can undo the last change if testing reveals an awkward solve.

Does a valid completed grid guarantee one solution?

No. The completed grid verifies that at least one solution exists. Uniqueness depends on the clues left visible to the player. The 14-clue version of this example admits two complete, valid grids, even though the maker began from one correct answer.

Is a puzzle with fewer clues always harder?

No. Clue count alone does not describe the deductions needed. Removing a clue may change nothing, force a longer comparison, or create multiple answers. Test both the solution count and the human solving path after each change.

• Compare two 8x8 puzzles with equal clues and different deductions

Finish with two independent checks

For your next homemade Binary Puzzle, start with a fully valid answer, erase and test one clue at a time, and stop when the remaining givens produce exactly one solution. Then solve from the handout without looking at the answer. Those two checks give your reader both a definite destination and a reasonable way to reach it.