Rule 3 Explained: Solving Binairo With Unique Rows and Columns
Binairo guide · 6 min read
Most people learn the binary puzzle through its first two rules — no three in a row, equal counts — and solve happily for a while. Then they hit a grid that just won't budge. Every pair is forced, every line is balanced, and still there are empty cells. Nine times out of ten, the way through is the rule beginners quietly ignore: Rule 3, the unique-lines rule. It says no two rows can be identical and no two columns can be identical, and it's the most underused solving weapon in the whole puzzle. This guide explains what Rule 3 means, why it exists, and exactly how to turn it into placements. Try it live as you read — play a binary puzzle and look for the move.
What Rule 3 says
The third rule of the binary puzzle (Binairo or Takuzu) is short: no two rows may be identical, and no two columns may be identical. Every row must be a unique pattern of 0s and 1s, and so must every column.
It's easy to nod past this rule because, unlike the other two, it rarely forces a move early in a solve. The first two rules — no three of the same symbol in a row, and an equal count of each per line — do most of the visible work. Rule 3 sits quietly in the background until the grid gets tight, then becomes the key that unlocks everything. (If you need a refresher on the everyday techniques, our solving guide covers them.)
Why the rule exists
Rule 3 has a real job: it's largely what guarantees a single solution. Without the unique-lines rule, many grids would have two or more valid completions — you could swap a couple of cells and end up with a different-but-legal grid. By banning duplicate lines, the puzzle forces exactly one answer and rewards deeper logic. So when you use Rule 3 to make a deduction, you're really using the constraint that makes the puzzle solvable in the first place.
How to use it: the duplicate-blocking move
The unique-lines rule turns into placements through one clean idea: if filling a nearly-complete line one way would make it a copy of a line that's already finished, you must fill it the other way.
Here's a worked example. Suppose one row in a 6×6 grid is already complete:
Row A:
0 1 1 0 1 0
Now look at another row that's almost done, with two empty cells left:
Row B:
0 1 1 0 _ _
Row B already has two 0s (columns 1 and 4) and two 1s (columns 2 and 3), so its last two cells must be one 0 and one 1 — that's forced by the equal-count rule. There are only two ways to place them:
- Option 1:
0 1 1 0 1 0— but that's identical to Row A. Rule 3 forbids it. - Option 2:
0 1 1 0 0 1— different from Row A, and perfectly legal.
Since Option 1 would create a duplicate row, it's banned, so Row B must be 0 1 1 0 0 1. Both empty cells are now forced. You didn't need a pair or a sandwich — only the fact that two rows can't match.
When to reach for it
Rule 3 is your go-to when the obvious techniques stall. Train yourself to look for it in these situations:
- A row or column has only two empty cells left, and one of the two fillings would copy a completed line. The other filling is forced.
- Two lines are nearly identical, matching everywhere except a couple of positions. Those positions must be filled to keep the lines different.
- Late in a tight grid, when pairs and counts are exhausted but cells remain — that's the unique-lines rule's moment.
The same logic applies to columns exactly as it does to rows, so scan both directions. On large grids — 12×12 and 14×14 — where there are many long lines that must all be distinct, this technique does a surprising amount of the heavy lifting.
The mindset shift
The real lesson of Rule 3 is to stop thinking of a line in isolation. A binary puzzle isn't a set of independent rows and columns; it's a grid where every line is competing to be different from every other. Once you start comparing partially-filled lines against the ones already done, dead-ends turn into forced moves, and the hardest grids open up. It's the technique that separates people who can finish a 6×6 from people who can finish a 14×14.
So next time a binary puzzle stalls, don't reach for a guess — reach for Rule 3. Find a nearly-complete line, check whether one filling would clone a finished one, and let uniqueness force your hand. Play a binary puzzle now and hunt for the duplicate-blocking move, or warm up with our step-by-step 6×6 walkthrough.
Frequently asked questions
What is Rule 3 in Binairo?
Rule 3 of Binairo (the binary puzzle) states that no two rows may be identical and no two columns may be identical. Every row must be a unique arrangement of 0s and 1s, and the same goes for every column. It's the rule that largely guarantees the puzzle has a single solution.
How do you use the unique-lines rule to solve a binary puzzle?
Find a row or column with only a couple of empty cells, then check the ways you could legally fill it. If one of those fillings would make the line identical to a line that's already complete, that option is banned by Rule 3 — so the other filling is forced. The same logic works for both rows and columns.
Why can't two rows be the same in a binary puzzle?
The no-duplicate-lines rule exists mainly to guarantee a unique solution. Without it, many grids could be completed in more than one valid way. By requiring every row and column to be distinct, the puzzle forces exactly one answer and enables deeper deductions.
When should I use Rule 3 while solving?
Reach for Rule 3 when the basic techniques — pair forcing, the sandwich rule, and count completion — have stalled but empty cells remain. It's most powerful when a line has just two cells left and one filling would duplicate a finished line, and on large grids (12×12, 14×14) where many lines must all stay distinct.