⚖️ Takuzu
🧩 Logic · 0 playsTakuzu
Fill a grid with two symbols under a pair of unforgiving constraints.
About Takuzu
Published elsewhere as Binairo or Unruly, this puzzle works with only noughts and ones. Two rules govern it: no more than two of the same symbol may stand together in a line, and each row and column must finish with as many noughts as ones. Every grid is generated with a single solution that deduction alone will reach, so guessing is never necessary and rarely survives. Most of the progress comes from the pair rule — a cell between two matching symbols is forced, as is the cell on either side of an existing pair.
How to Play
Tapping a cell cycles it: empty, then 0, then 1. Never three of the same symbol together in a line, and equal counts of each in every row and column. Broken rules are marked in red. Complete every cell to finish.
💡 Tips & Strategy
Two rules generate every deduction, and the first is about triples. No three identical symbols may sit consecutively, so a pair like 0 0 forces a 1 on both open sides, and a split pair such as 1 blank 1 forces a 0 in the gap. Scan every row and column for pairs and split pairs before anything else.
The second is counting. Each line holds equal numbers of both symbols, so once half a line is filled with one symbol, every remaining cell in it takes the other. This rule tends to fire late in a line and then completes it instantly, so re-count lines whenever you add a symbol.
Combine the two when neither works alone. If a line needs two more 0s and placing one at a particular cell would create a forbidden triple somewhere, the other arrangement is forced. On larger grids this hypothetical test is usually quicker than hunting for another direct deduction.
Work rows and columns alternately rather than finishing one direction first. Each symbol you place belongs to two lines at once, and the second line is where the next forced move typically appears.