Pips answers for Thursday, January 22, 2026

Start with the “=” region at the center: all 3 cells must show the same number, and only 1s appear on enough dominoes to fill it.

• the “=” region at the top-left: 6, 6
• the “=” region at the center: 1, 1, 1
• the single-cell “<3” region at the bottom-right: 2

1. The “=” region at the center needs every pip to match — 8 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 1–6 domino vertically on row 1, column 1 and row 2, column 1.
2. The “=” region at the top-left needs every pip to match (1 of its 2 cells is already filled) — nothing else fits. Place the 2–6 domino horizontally on row 1, column 2 and row 1, column 3.
3. The “=” region at the center needs every pip to match (1 of its 3 cells is already filled) — 2 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 1–1 domino horizontally on row 2, column 2 and row 2, column 3.
4. Row 3, column 3 has only one open neighbor, so its domino must run to row 3, column 2; the single-cell “<3” region at the bottom-right must total less than 3 — nothing else fits. Place the 2–4 domino horizontally on row 3, column 2 and row 3, column 3.

Start with the “=” region at the right: all 3 cells must show the same number, and only 1 or 2 or 6 appear on enough dominoes to fill it.

• the “=” region at the top-right: 0, 0
• the “=” region at the right: 1, 1, 1
• the “=” region at the bottom-left: 2, 2, 2
• the single-cell “>3” region at the bottom-right: 6

1. The “=” region at the bottom-left needs every pip to match — 4 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 2–2 domino vertically on row 6, column 1 and row 7, column 1.
2. Row 5, column 1 has only one open neighbor, so its domino must run to row 5, column 2; the “=” region at the bottom-left needs every pip to match (2 of its 3 cells are already filled) — nothing else fits. Place the 1–2 domino horizontally on row 5, column 1 and row 5, column 2.
3. The “=” region at the right needs every pip to match (1 of its 3 cells is already filled) — 2 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 0–1 domino vertically on row 3, column 3 and row 4, column 3.
4. Row 2, column 3 has only one open neighbor, so its domino must run to row 1, column 3; the “=” region at the top-right needs every pip to match (1 of its 2 cells is already filled) — nothing else fits. Place the 0–6 domino vertically on row 1, column 3 and row 2, column 3.
5. Row 5, column 3 has only one open neighbor, so its domino must run to row 6, column 3; the “=” region at the right needs every pip to match (2 of its 3 cells are already filled) — nothing else fits. Place the 1–3 domino vertically on row 5, column 3 and row 6, column 3.
6. Row 7, column 3 has only one open neighbor, so its domino must run to row 7, column 2; the single-cell “>3” region at the bottom-right must total more than 3 — nothing else fits. Place the 6–6 domino horizontally on row 7, column 2 and row 7, column 3.

Start with the “<2” region at the bottom-left: the only way to make it with these dominoes is 0 + 0.

• the “=” region at the top: 4, 4, 4
• the single-cell “>4” region at the top-right: 5
• the 10 region at the left: 4, 6
• the “=” region at the center: 3, 3, 3
• the “=” region at the center: 5, 5
• the “>16” region at the bottom-right: 6, 6, 6
• the “<2” region at the bottom-left: 0, 0
• the 9 region at the bottom: 3, 6

1. The 10 region at the left needs a total of exactly 10 — nothing else fits. Place the 0–4 domino vertically on row 3, column 1 and row 4, column 1.
2. Row 4, column 2 has only one open neighbor, so its domino must run to row 4, column 3; the “<2” region at the bottom-left must total less than 2 (1 of its 2 cells is already filled) — nothing else fits. Place the 0–3 domino horizontally on row 4, column 2 and row 4, column 3.
3. The “=” region at the top needs every pip to match — 2 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 4–4 domino horizontally on row 1, column 2 and row 1, column 3.
4. Row 1, column 4 has only one open neighbor, so its domino must run to row 2, column 4; the “=” region at the top needs every pip to match (2 of its 3 cells are already filled) — 2 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 3–4 domino vertically on row 1, column 4 and row 2, column 4.
5. The “=” region at the center needs every pip to match (1 of its 3 cells is already filled) — 2 placements fit here for now, but every other one leaves some region impossible a few moves later. Place the 3–5 domino vertically on row 2, column 5 and row 3, column 5.
6. The “=” region at the center needs every pip to match (2 of its 3 cells are already filled) — nothing else fits. Place the 3–6 domino vertically on row 2, column 6 and row 3, column 6.
7. Row 3, column 4 has only one open neighbor, so its domino must run to row 4, column 4; the “=” region at the center needs every pip to match (1 of its 2 cells is already filled) — nothing else fits. Place the 5–6 domino vertically on row 3, column 4 and row 4, column 4.
8. Row 4, column 6 has only one open neighbor, so its domino must run to row 4, column 7; the “>16” region at the bottom-right must total more than 16 (1 of its 3 cells is already filled) — nothing else fits. Place the 6–6 domino horizontally on row 4, column 6 and row 4, column 7.
9. Row 2, column 1 has only one open neighbor, so its domino must run to row 1, column 1; the 10 region at the left needs a total of exactly 10 (1 of its 2 cells is already filled) — nothing else fits. Place the 2–6 domino vertically on row 1, column 1 and row 2, column 1.
10. Row 1, column 7 has only one open neighbor, so its domino must run to row 1, column 6; the single-cell “>4” region at the top-right must total more than 4 — nothing else fits. Place the 4–5 domino horizontally on row 1, column 6 and row 1, column 7.