Gift-a-piece attribute board
Give the next piece to your opponent; place the piece you receive to make four sharing a property.
Logic & rule checking · Shape & spatial thinking
- Players
- 2 players
- Time
- 15–25 minutes
- Materials and quantities
- Sixteen distinct four-bit cards, one 4×4 board and a rule legend. One card is one piece.
2 players
Prepare
Each piece has four independent binary properties, represented by a four-bit label. The sixteen labels 0000 through 1111 are all different. Place unused cards face up beside an empty 4×4 board. Read bit positions from left to right and never reorder a label.
Play
The first player gives any unused card to the other player. The receiver places that card on an empty square and checks the board. If there is no win, the receiver gives a remaining unused card to the opponent, who must place it. A player cannot replace the given card with a safer one.
Win condition
After placing, win if a complete row, column or one of the two full corner diagonals contains four cards all having the same value in at least one bit position. All four might begin 0, for example. A shared mixture of two properties on only three cards does not count.
Example and end
A row 0000, 0001, 0010, 0011 wins: all have 0 in the first and second positions. The first such complete line ends the game immediately; if all squares fill without one, draw. Record the four labels and the common bit to justify the result.
Adapt
Keep labels textual and use a ruler to compare the same bit column on each card. A helper may read bits aloud. Practise checking one completed row before playing; this is a paper representation, not an automated judge.
Aim: Give the next piece to your opponent; place the piece you receive to make four sharing a property.
Practice within this activity: Give the next piece to your opponent; place the piece you receive to make four sharing a property.
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: Write all binary strings 0000 to 1111 on sixteen large scrap cards. No special wooden set is needed.
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 placement board
Give an unused card to your opponent. They place that exact piece; then give you another. Four cards in a complete line must share the same value in at least one bit position.
Sixteen distinct piece cards
Adult cuts the cards; each four-bit label is one indivisible piece. Bits stay in their printed order.
Teacher instructions and checked example · separate
2 players
Sixteen distinct four-bit cards, one 4×4 board and a rule legend. One card is one piece.
Write all binary strings 0000 to 1111 on sixteen large scrap cards. No special wooden set is needed.
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.
Winning example: 0000,0001,0010,0011 in a full row share leading 0 (and the next 0). Check rows, columns and the two full diagonals only. Gift first, then receive/place; do not choose your own piece.
| Line labels | Common bit position/value |
|---|---|
| 0000 / 0001 / 0010 / 0011 | 1 → 0; 2 → 0 |