NYT Pips Hints & Answers: Thursday, 9 July 2026
Hints and full solutions for Easy, Medium and Hard.
Easy hints and answer for Thursday, 9 July 2026
The <3 cell sits alone at the top, so it needs a low face: 0, 1, or 2. Only the 2|3 among the available dominoes has a face that fits, since the 4-6, 4-5, and 4-0 all carry values too high, and the 1-5 would leave the 5 stranded with nowhere legal to go. So the 2|3 goes there, with its 2-face in the <3 cell and its 3-face extending into the =4 region.
The =4 region already has that 3-face sitting in it, so it needs just one more pip to reach 4. That means the neighbouring =10 region and the rest of the =4 region need to work together: the 1|5 puts its 1-face into =4 to make 3+1=4, and its 5-face lands in the =10 region. The 4|0 then covers the remaining =10 cell with its 0-face, since 5+0 doesn't reach 10, so its 4-face must be the one pushed toward the last =10 region instead.
Two dominoes remain for two =10 regions: the 4|5 and the 4|6. The 4|0 already placed its 4-face into one =10 region, so that region needs a 6 to reach 10, meaning the 4|6 belongs there with its 6-face inside and its 4-face spilling into the 'all equal' region. That leaves the 4|5 for the last spot, with its 4-face completing the other =10 region alongside the 6, and its 5-face pairing with the 4|6's 4 isn't equal, so check again: the 'all equal' region needs matching faces, forcing the 4|5 and 4|6 to align so both blank cells show 4.
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 <3 cell sits alone at the top, so it needs a low face: 0, 1, or 2. Only the 2|3 among the available dominoes has a face that fits, since the 4-6, 4-5, and 4-0 all carry values too high, and the 1-5 would leave the 5 stranded with nowhere legal to go. So the 2|3 goes there, with its 2-face in the <3 cell and its 3-face extending into the =4 region.
Hint 2
The =4 region already has that 3-face sitting in it, so it needs just one more pip to reach 4. That means the neighbouring =10 region and the rest of the =4 region need to work together: the 1|5 puts its 1-face into =4 to make 3+1=4, and its 5-face lands in the =10 region. The 4|0 then covers the remaining =10 cell with its 0-face, since 5+0 doesn't reach 10, so its 4-face must be the one pushed toward the last =10 region instead.
Hint 3
Two dominoes remain for two =10 regions: the 4|5 and the 4|6. The 4|0 already placed its 4-face into one =10 region, so that region needs a 6 to reach 10, meaning the 4|6 belongs there with its 6-face inside and its 4-face spilling into the 'all equal' region. That leaves the 4|5 for the last spot, with its 4-face completing the other =10 region alongside the 6, and its 5-face pairing with the 4|6's 4 isn't equal, so check again: the 'all equal' region needs matching faces, forcing the 4|5 and 4|6 to align so both blank cells show 4.
Answer, step by step
The <3 cell sits alone at the top, so it needs a low face: 0, 1, or 2. Only the 2|3 among the available dominoes has a face that fits, since the 4-6, 4-5, and 4-0 all carry values too high, and the 1-5 would leave the 5 stranded with nowhere legal to go. So the 2|3 goes there, with its 2-face in the <3 cell and its 3-face extending into the =4 region. The =4 region already has that 3-face sitting in it, so it needs just one more pip to reach 4. That means the neighbouring =10 region and the rest of the =4 region need to work together: the 1|5 puts its 1-face into =4 to make 3+1=4, and its 5-face lands in the =10 region. The 4|0 then covers the remaining =10 cell with its 0-face, since 5+0 doesn't reach 10, so its 4-face must be the one pushed toward the last =10 region instead. Two dominoes remain for two =10 regions: the 4|5 and the 4|6. The 4|0 already placed its 4-face into one =10 region, so that region needs a 6 to reach 10, meaning the 4|6 belongs there with its 6-face inside and its 4-face spilling into the 'all equal' region. That leaves the 4|5 for the last spot, with its 4-face completing the other =10 region alongside the 6, and its 5-face pairing with the 4|6's 4 isn't equal, so check again: the 'all equal' region needs matching faces, forcing the 4|5 and 4|6 to align so both blank cells show 4.
About this puzzle
10 cells (5 × 3) · 5 dominoes · 34 pips · 5 ruled regions · <3, =4, =10, all equalConstructed by Ian Livengood
Where to start: the order the regions give way
- <3top right
- =4right
- =10left
- =10bottom right
Medium hints and answer for Thursday, 9 July 2026
The =10 region only has two cells, so you need two faces adding to 10. Scanning the dominoes, only the 4|6 or the 4|3 could get close, but the 4|6 is too big to fit alongside the neighbouring <3 cell without breaking it. That leaves the 4|3, with both faces landing in the =10 region... wait, check again: 4+3 only makes 7, so the actual pair that works here is 4 and 6 split so the 4-face sits in =10 alongside another domino's 6. Working through the available dominoes, the 4|3 fits the =10 region only if paired with a 6-face domino next door, which is exactly what the 2|6 provides in the <3 cell's neighbour, so the 4|3 sits across the =10 region and the blank cell below it, while the 2|6 covers the <3 cell and the region beside it.
Look at the >7 region now. It needs two faces summing above 7, and with the 4|3 and 2|6 already down, only the 4|6 domino has faces big enough to clear that bar. Placing the 4|6 there gives 4+6=10, well past 7, so that pair is locked. That frees up the 1|2 domino for the <3 region on the opposite side, since 1+2=3 is the only remaining option that doesn't overshoot.
Two 'all equal' regions are left, and only doubles can fill them. The 3|3 is the only double left that fits the two-cell equal region on the right, so that goes down first. That leaves the 1|5 and 2|2 for the last two spots: the 2|2 is the only double among what remains, so it takes the three-cell equal region, and the 1|5 fills the blank cell plus the neighbouring <3 space with its 1-face keeping that region under 3.
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
The =10 region only has two cells, so you need two faces adding to 10. Scanning the dominoes, only the 4|6 or the 4|3 could get close, but the 4|6 is too big to fit alongside the neighbouring <3 cell without breaking it. That leaves the 4|3, with both faces landing in the =10 region... wait, check again: 4+3 only makes 7, so the actual pair that works here is 4 and 6 split so the 4-face sits in =10 alongside another domino's 6. Working through the available dominoes, the 4|3 fits the =10 region only if paired with a 6-face domino next door, which is exactly what the 2|6 provides in the <3 cell's neighbour, so the 4|3 sits across the =10 region and the blank cell below it, while the 2|6 covers the <3 cell and the region beside it.
Hint 2
Look at the >7 region now. It needs two faces summing above 7, and with the 4|3 and 2|6 already down, only the 4|6 domino has faces big enough to clear that bar. Placing the 4|6 there gives 4+6=10, well past 7, so that pair is locked. That frees up the 1|2 domino for the <3 region on the opposite side, since 1+2=3 is the only remaining option that doesn't overshoot.
Hint 3
Two 'all equal' regions are left, and only doubles can fill them. The 3|3 is the only double left that fits the two-cell equal region on the right, so that goes down first. That leaves the 1|5 and 2|2 for the last two spots: the 2|2 is the only double among what remains, so it takes the three-cell equal region, and the 1|5 fills the blank cell plus the neighbouring <3 space with its 1-face keeping that region under 3.
Answer, step by step
The =10 region needs two faces summing to ten, and checking the dominoes, the 4|3 is the one that can sit there with its neighbour completing the picture, so it goes down first with the 3-face in the =10 region and the 4-face spilling into the blank cell beside it. That forces the <3 region next door to take a small face, and the 2|6 is the only domino left that can supply a low value there while its other face reaches into the neighbouring space, so the 2|6 goes in with its low face satisfying the <3 rule. With those two down, the >7 region needs a big pair, and only the 4|6 clears that bar, so it drops in giving 4+6=10. That leaves the 1|2 for the remaining <3 region, and 1+2=3 fits exactly. Two 'all equal' regions remain, so only doubles will do: the 3|3 covers the two-cell equal region, leaving the 2|2 for the three-cell equal region. That leaves the 1|5 for the last blank and <3 pairing, with its low face keeping that region under 3.
About this puzzle
14 cells (4 × 4) · 7 dominoes · 44 pips · 6 ruled regions and 2 free cells · =10, <3, >7, all equalConstructed by Rodolfo Kurchan
Where to start: the order the regions give way
- =10top left
- <3top right
- >7top right
- <3bottom left
Hard hints and answer for Thursday, 9 July 2026
Look at the bottom-left corner, the >4 cell. It needs a domino with a high face, and only a few dominoes qualify. Try the 6|2 there and its 2-face lands in the <3 cell above, but that cell already has other pressure from neighbouring regions, so trace it through and you'll find only the 2|5 survives: the 5-face satisfies >4, and the 2-face fits the <3 cell beside it. Once that's down, the =6 region next to it only has the 6|2 left to make its pair sum to 6, which forces the =6 single cell to take the 1|6, leaving the 3|0 as the only domino that can make the =3 region below equal 3.
The <2 cell up near the top-right only accepts a 0 or 1 face, and checking what's left, the 1|3 is the only domino that can sit there without breaking the >7 region beside it. That pushes its 3-face into the >7 pair, so the other cell in that region needs a face of 5 or more to clear 7, and the 5|4 is the only domino left that can deliver a 5 there. With that placed, the =3 region up top only has the 4|3 left that can put its 3-face in one cell without overshooting the sum.
Now the =3 region beside the top corner needs a 4 in its other cell, and the only domino left holding a 4 is the 0|4, so that goes in with the 0-face spilling into the <3 cell beside it. That leaves the =3 cell in the second row needing a 3, which only the 2|3 can supply, with its 2-face landing in the <3 cell below. The remaining =3 region across three cells needs its total to hit 3, and with only the 1|1 and 1|2 left, the 1|1 pair gives exactly 1+1 while the 1|2 fills the last cell with its 1-face, finishing the sum at 3.
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
Look at the bottom-left corner, the >4 cell. It needs a domino with a high face, and only a few dominoes qualify. Try the 6|2 there and its 2-face lands in the <3 cell above, but that cell already has other pressure from neighbouring regions, so trace it through and you'll find only the 2|5 survives: the 5-face satisfies >4, and the 2-face fits the <3 cell beside it. Once that's down, the =6 region next to it only has the 6|2 left to make its pair sum to 6, which forces the =6 single cell to take the 1|6, leaving the 3|0 as the only domino that can make the =3 region below equal 3.
Hint 2
The <2 cell up near the top-right only accepts a 0 or 1 face, and checking what's left, the 1|3 is the only domino that can sit there without breaking the >7 region beside it. That pushes its 3-face into the >7 pair, so the other cell in that region needs a face of 5 or more to clear 7, and the 5|4 is the only domino left that can deliver a 5 there. With that placed, the =3 region up top only has the 4|3 left that can put its 3-face in one cell without overshooting the sum.
Hint 3
Now the =3 region beside the top corner needs a 4 in its other cell, and the only domino left holding a 4 is the 0|4, so that goes in with the 0-face spilling into the <3 cell beside it. That leaves the =3 cell in the second row needing a 3, which only the 2|3 can supply, with its 2-face landing in the <3 cell below. The remaining =3 region across three cells needs its total to hit 3, and with only the 1|1 and 1|2 left, the 1|1 pair gives exactly 1+1 while the 1|2 fills the last cell with its 1-face, finishing the sum at 3.
Answer, step by step
The >4 corner cell needs a strong face, and working through the options only the 2|5 fits, its 5 satisfying >4 while the 2-face drops into the <3 cell next door. That forces the neighbouring =6 region to take the 6|2, since it's the only domino left that can make that pair sum to 6. With the 6 placed, the =6 single cell above needs a 6-face too, and only the 1|6 remains to do it, so it slots in with the 1-face spilling into the adjacent <3 slot. That leaves the =3 region below needing a domino whose faces sum to 3 across two cells, and the 3|0 is the only one left that works. Moving to the <2 cell, only the 1|3 can sit there without breaking the >7 pair beside it, so its 3-face goes into the >7 region, demanding a 5 or more from the other cell there. The 5|4 is the only domino left with a high enough face, so it goes in, its 4-face landing in the =6 region and finishing that sum. That leaves the =3 pair at the bottom-right needing a domino, and the 2|4 is the only fit, its 2-face completing the sum while the 4-face rests in the blank cell beside it. Up top, the =3 region takes the 4|3, its 3-face settling the sum and the 4-face spilling into the region beside it, which forces the 0|4 into the remaining =3 cell with its 0-face completing that sum and the 4-face reaching into the <3 slot next door. That pushes the 2|3 into the =3 cell below, its 3-face completing the sum and its 2-face dropping into the final <3 cell. All that's left is the three-cell =3 region, and with the 1|1 and 1|2 remaining, the 1|1 covers two cells for 1+1, while the 1|2 fills the last cell with its 1-face, bringing that region to exactly 3.
About this puzzle
24 cells (6 × 6) · 12 dominoes · 65 pips · 16 ruled regions and 1 free cell · >3, =3, <3, >7, <2, =6, >4Constructed by Rodolfo Kurchan
Where to start: the order the regions give way
- <3bottom left
- >4bottom left
- =6right
- =6bottom right
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.