Balanced binary board
Fill the grid with equal zeros and ones, no three consecutive equal symbols, and distinct full rows and columns.
Logic & rule checking · Observation & recall
- Players
- 1–4 cooperative
- Time
- 10–18 minutes
- Materials and quantities
- One 4×4 clue grid and pencil. All entries are 0 or 1.
1–4 cooperative
Prepare
Copy the supplied 0 and 1 clues, leaving blank cells empty. A final row contains two of each symbol; so does each column. Two completed rows may not be identical, and neither may two completed columns. A row may equal a column; that comparison is not part of the rule.
Play
Add one symbol at a time. Prevent a third consecutive equal symbol horizontally or vertically. A line with two zeros needs ones in its remaining spaces, and vice versa. Do not alter a printed clue to repair a later error; erase only your own entries and reconsider.
Example
0,0,blank,blank must finish 0,0,1,1 by equal counts. 1,blank,1,0 forces the blank to 0 because 1,1,1 would be a forbidden run. The no-three rule applies only to consecutive straight cells, not a diagonal.
End
Check all four rows and four columns for balance, consecutive runs and duplicate full lines. One verified completion is supplied separately; if another meets every rule and clue, accept it. A nearly full grid with one duplicated column is still unfinished.
Adapt
Use counters marked circle and square with a clear 0/1 legend. Separate the three checks into different partner roles, and let a helper write the chosen entry. No timed ranking is needed.
Aim: Fill the grid with equal zeros and ones, no three consecutive equal symbols, and distinct full rows and columns.
Practice within this activity: Fill the grid with equal zeros and ones, no three consecutive equal symbols, and distinct full rows and columns.
Adult observation: Ask the participant to explain one legal choice. Accept passing and a partner writing; do not infer a lasting ability from a single round.
Mechanism and adaptation: A separately written PartyPageKit version of the mechanism described below, with original examples and materials. The earliest inventor is not established here.
Goals describe observable activity choices, not measured long-term gains or institutional endorsement.
Free alternatives: Draw sixteen boxes and copy the printed givens; use two large shape markers if digits are hard to read.
Buying recommendations reserved; no purchase required.
Printable materials
Preview at 100% scale, with browser headers and footers off. Cut with suitable help. Keep host keys separate. This is a manual tabletop kit, not an online opponent, automatic judge or solver.
Player binary clue grid
Every row/column: two 0s and two 1s, no three consecutive equals, no duplicate full rows or duplicate full columns. Keep givens.
Binary rule audit
| Line | Two each? | No three? | Distinct line? |
|---|---|---|---|
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
| ________ | ________ | ________ | ________ |
Teacher instructions and checked example · separate
1–4 cooperative
One 4×4 clue grid and pencil. All entries are 0 or 1.
Draw sixteen boxes and copy the printed givens; use two large shape markers if digits are hard to read.
Print only the relevant player pages; keep this teacher page separate. Read the full web rules before leading. A helper may write or move pieces, and anyone may pause or pass. No classroom or physical-printer trial is claimed.
One completion, rows 1→4: 0011 / 0101 / 1010 / 1100. All original clues agree. Check columns separately; diagonal triples do not count. Accept other completions satisfying all rules.