NYT Pips Hints & Answers: Sunday, 29 March 2026
Hints and full solutions for Easy, Medium and Hard.
Easy hints and answer for Sunday, 29 March 2026
The 'all equal' region needs three cells with the same pip value. Only two dominoes have matching faces: the 3|3 and 5|5. If you try the 5|5 spanning two cells of this region, the remaining cell needs a 5 from another domino, but none of the others have a 5-face. That forces the 3|3 to cover the first two cells of the 'all equal' region.
The third cell in the 'all equal' region needs a 3-face, and only the 3|6 can provide it. That domino extends from the 'all equal' region into the >4 cell, putting its 6-face there. Now look at the isolated =3 cell at the bottom: only the 0|3 reaches it, with the 3-face satisfying the constraint and the 0 extending into the neighbouring =5 region.
One =5 region already has a 0 from the previous placement, so it needs 5 more from its other cell. The 5|5 is the only domino left that can provide this, covering both cells of the remaining =5 region. The 0|4 fills the last gap.
Every domino is on the board. The full walkthrough is just below.
That's the full solution.
Stuck? Get one nudge at a time, or see the whole answer.
Easy Pips hints and answer in full
Hint 1
The 'all equal' region needs three cells with the same pip value. Only two dominoes have matching faces: the 3|3 and 5|5. If you try the 5|5 spanning two cells of this region, the remaining cell needs a 5 from another domino, but none of the others have a 5-face. That forces the 3|3 to cover the first two cells of the 'all equal' region.
Hint 2
The third cell in the 'all equal' region needs a 3-face, and only the 3|6 can provide it. That domino extends from the 'all equal' region into the >4 cell, putting its 6-face there. Now look at the isolated =3 cell at the bottom: only the 0|3 reaches it, with the 3-face satisfying the constraint and the 0 extending into the neighbouring =5 region.
Hint 3
One =5 region already has a 0 from the previous placement, so it needs 5 more from its other cell. The 5|5 is the only domino left that can provide this, covering both cells of the remaining =5 region. The 0|4 fills the last gap.
Answer, step by step
The 'all equal' region forces the 3|3 into its first two cells, since the 5|5 would leave the third cell unreachable by any domino with a 5-face. That means the remaining cell needs a 3, which only comes from the 3|6, placing its 6-face in the >4 cell. The isolated =3 cell can only be reached by the 0|3, extending its 0-face into the adjacent =5 region. That region now needs 5 more pips, so the 5|5 covers both remaining cells of the other =5 region. The 0|4 completes the grid in the remaining gap.
About this puzzle
10 cells (5 × 3) · 5 dominoes · 32 pips · 5 ruled regions and 1 free cell · all equal, >4, =5, =3Constructed by Ian Livengood
Where to start: the order the regions give way
- all equaltop left
- >4top right
- =3bottom
- =5bottom right
Medium hints and answer for Sunday, 29 March 2026
Two regions need exactly 4 on two cells: the vertical =4 region on the left edge and the 'all equal' region on the right. Only two dominoes can make 4 on two cells: the 2|2 and the 4|4. The 2|2 could work for either region, but the 4|4 can only satisfy the 'all equal' constraint since both faces must match. That locks the 4|4 into the 'all equal' region, and since the left =4 region still needs filling, check what works there: with the remaining dominoes, only the 3|1 adds to 4.
Now examine the =3 region spanning three cells. You need dominoes that can contribute the right faces to sum to 3. The middle cell of this region connects to the single-cell =4 region above it. The 1|4 domino can put its 4-face in that =4 cell and its 1-face into the =3 region. For the blank cell at the top, the 1|6 works perfectly: the 1-face doesn't constrain the blank region, while the 6-face satisfies the >1 region next to it.
Three dominoes remain: the 0|0, 2|0, and 2|2. The <4 regions need values under 4, so both the 2|0 and 0|0 could work there. However, the 2|0 can put its 2-face in the remaining =4 cell and its 0-face in the <4 region. That forces the 2|2 to complete the =3 region, and leaves the 0|0 for the final <4 cell.
Every domino is on the board. The full walkthrough is just below.
That's the full solution.
Stuck? Get one nudge at a time, or see the whole answer.
Medium Pips hints and answer in full
Hint 1
Two regions need exactly 4 on two cells: the vertical =4 region on the left edge and the 'all equal' region on the right. Only two dominoes can make 4 on two cells: the 2|2 and the 4|4. The 2|2 could work for either region, but the 4|4 can only satisfy the 'all equal' constraint since both faces must match. That locks the 4|4 into the 'all equal' region, and since the left =4 region still needs filling, check what works there: with the remaining dominoes, only the 3|1 adds to 4.
Hint 2
Now examine the =3 region spanning three cells. You need dominoes that can contribute the right faces to sum to 3. The middle cell of this region connects to the single-cell =4 region above it. The 1|4 domino can put its 4-face in that =4 cell and its 1-face into the =3 region. For the blank cell at the top, the 1|6 works perfectly: the 1-face doesn't constrain the blank region, while the 6-face satisfies the >1 region next to it.
Hint 3
Three dominoes remain: the 0|0, 2|0, and 2|2. The <4 regions need values under 4, so both the 2|0 and 0|0 could work there. However, the 2|0 can put its 2-face in the remaining =4 cell and its 0-face in the <4 region. That forces the 2|2 to complete the =3 region, and leaves the 0|0 for the final <4 cell.
Answer, step by step
The 'all equal' region needs matching faces, so the 4|4 is the only option there since it's the only double that works. The vertical =4 region on the left needs two faces summing to 4, which means the 3|1 goes there with faces adding to 4. The single =4 cell connects to the =3 region, so the 1|4 can put its 4-face there and contribute 1 to the three-cell =3 region. The 1|6 covers the blank cell and the >1 cell, with the 6 satisfying the greater-than constraint. The 2|0 puts its 2-face in the remaining spot of the =4 region and its 0 in the <4 region. The 2|2 adds its 2-face to complete the =3 region's sum of 1+2=3. The 0|0 fills the final <4 cell with 0, which satisfies the less-than-4 constraint.
About this puzzle
14 cells (4 × 6) · 7 dominoes · 30 pips · 8 ruled regions and 1 free cell · >1, <4, =4, =3, all equalConstructed by Rodolfo Kurchan
Where to start: the order the regions give way
- =4bottom left
- all equalbottom right
- =3bottom
- >1top
Hard hints and answer for Sunday, 29 March 2026
The >10 region needs two faces that sum to more than 10. Only three dominoes can manage this: 5|6, 6|6, or 4|6. The 6|6 would put both 6-faces there, but then the =10 region below has only the 4|6 left, which makes 10 exactly. The 5|6 could work, but check where its faces would land. Actually, the 6|1 is the key: it's the only domino that can satisfy both the >10 constraint (6+1=7 is wrong, let me reconsider). Looking at the =1 regions, only dominoes with 1-faces can work: 6|1, 0|1, and 4|1. The 6|1 must go in the corner =1 region since its 6-face satisfies the >10 constraint perfectly when paired with something else.
Once the 6|1 is placed, the remaining =1 regions need the 0|1 and 4|1. The 0|1 fits naturally between the two =1 cells on the right. The bottom 'all equal' region spans four cells and needs a double domino plus another matching pair. Only 0|0 works for the double, and it forces the remaining cells to need 0-faces from other dominoes.
The top 'all equal' region needs matching values across its four cells. With most dominoes placed, only the 5|5 and 5|6 can provide the matching 5-faces it needs. The 5|5 goes in the corner, forcing the 5|6 to complete the region.
Every domino is on the board. The full walkthrough is just below.
That's the full solution.
Stuck? Get one nudge at a time, or see the whole answer.
Hard Pips hints and answer in full
Hint 1
The >10 region needs two faces that sum to more than 10. Only three dominoes can manage this: 5|6, 6|6, or 4|6. The 6|6 would put both 6-faces there, but then the =10 region below has only the 4|6 left, which makes 10 exactly. The 5|6 could work, but check where its faces would land. Actually, the 6|1 is the key: it's the only domino that can satisfy both the >10 constraint (6+1=7 is wrong, let me reconsider). Looking at the =1 regions, only dominoes with 1-faces can work: 6|1, 0|1, and 4|1. The 6|1 must go in the corner =1 region since its 6-face satisfies the >10 constraint perfectly when paired with something else.
Hint 2
Once the 6|1 is placed, the remaining =1 regions need the 0|1 and 4|1. The 0|1 fits naturally between the two =1 cells on the right. The bottom 'all equal' region spans four cells and needs a double domino plus another matching pair. Only 0|0 works for the double, and it forces the remaining cells to need 0-faces from other dominoes.
Hint 3
The top 'all equal' region needs matching values across its four cells. With most dominoes placed, only the 5|5 and 5|6 can provide the matching 5-faces it needs. The 5|5 goes in the corner, forcing the 5|6 to complete the region.
Answer, step by step
The >10 region in the bottom-left needs the 6|1, with the 6-face contributing to the greater-than constraint and the 1-face satisfying the =1 region. The =10 region in the middle needs the 4|6 to hit exactly 10. The remaining =1 regions force the 4|1 and 0|1 into position, with the 4|1 spanning into the blank region and the 0|1 connecting the two =1 cells on the right. The bottom 'all equal' region gets the 0|0 double, which means its other two cells need 0-faces as well. The 0|2 provides one 0-face there, while the remaining =10 region gets the 4|4. The =0 region needs the 4|0, putting its 0-face there and its 4-face in the top =10 region. That region completes with the 6|6. The top 'all equal' regions need matching faces: the 5|6 spans between them, and the 5|5 fills the corner. The middle 'all equal' region gets the 2|2, and finally the 2|5 completes the grid with the 4|5 taking the last position.
About this puzzle
28 cells (6 × 7) · 14 dominoes · 90 pips · 12 ruled regions and 2 free cells · all equal, =10, =1, =0, >10Constructed by Rodolfo Kurchan
Where to start: the order the regions give way
- >10bottom left
- =1bottom left
- =10right
- =1top left
Race other players on the dotio daily, free in your browser →
Love Pips? Try dotio
4,800 puzzles with the same rules, a new daily challenge every day and a global leaderboard. Pay once, no ads.
Or play the daily free in your browser →New to Pips? Here's how it works.
The grid. Each puzzle is a grid of cells. Some grids are rectangular; others have irregular shapes with gaps. Every playable cell must be covered by a domino.
Placing dominoes. A domino covers exactly two adjacent cells (horizontally or vertically). Each domino has a pip value on each half. These are the dots you see. You're given a set of dominoes and must place all of them on the grid.
Constraints. Coloured regions on the grid have rules that the pip values must satisfy:
- Sum (=N): the pip values of all cells in the region must add up to exactly N.
- All equal (=): every cell in the region must have the same pip value.
- All different (≠): every cell in the region must have a different pip value.
- Less than (<N): the sum of pip values must be less than N.
- Greater than (>N): the sum of pip values must be greater than N.
The goal. Place every domino so that all constraints are satisfied simultaneously. Every puzzle has exactly one solution, so nothing has to be guessed.
Tips. Start with the most constrained cells: corners, edges, and small regions with tight rules. Work outward from what you know. If you're stuck, our hints above walk you through the logic step by step.
Want thousands more puzzles like this? dotio has 4,800+ domino logic puzzles with daily leaderboards, friends groups, and a one-time price. No subscription. See how dotio compares to NYT Pips.
Frequently Asked Questions
How do I solve NYT Pips puzzles?
Start with the most constrained regions: those with tight rules like exact sums or equality constraints. Identify which dominoes can physically fit each region, then eliminate impossible placements. Every puzzle has exactly one solution discoverable through pure logic. For a full walkthrough of solving techniques, see our Pips tutorial.
What do the coloured regions mean in Pips?
Each coloured region has a constraint that the pip values must satisfy. =N means the values must sum to N. = means all values must be equal. ≠ means all values must be different. <N and >N mean the sum must be less than or greater than N.
Can one domino cover two different coloured regions?
Yes. A domino covers exactly two adjacent cells, and each half satisfies the constraint of whichever region it falls in. This is a key part of solving harder puzzles. A single domino can help satisfy two different rules at once.
How are the hints on this page structured?
We use progressive hints for each difficulty level. Hint 1 gives you a gentle nudge about where to start. Hint 2 narrows things down further. Hint 3 gives you specific placement guidance. The full solution reveals the complete walkthrough. This way you get exactly as much help as you need without spoiling the whole puzzle.
Where can I play more puzzles like Pips?
dotio has over 4,800 domino logic puzzles using the same rules as NYT Pips, with four difficulty levels, daily challenges, and global leaderboards. Buy once and there is no subscription. There is also a free daily puzzle to play in your browser, and an honest rundown of the other games like Pips if you want to compare.
What strategies help with harder Pips puzzles?
For medium and hard puzzles, try elimination: if a domino can only physically fit in one position, place it first. Then look for chain implications: "if this domino goes here, that forces another domino there." For more detailed strategies, see our tips and strategy guide.