NYT Pips Hints & Answers: Tuesday, 17 November 2026
Hints and full solutions for Easy, Medium and Hard.
Easy hints and answer for Tuesday, 17 November 2026
Look at the isolated cell in the bottom-right, the <6 cell that only touches one neighbour. Whatever domino sits there also has to drop a face into the >10 region next door. The highest face available is 6, so if the neighbouring >10 cell gets 6, this cell's partner needs to push the pair past 10. Only the 5|2 has a 5 to pair against that 6, with 2 safely under 6 for the <6 cell, so the 5|2 goes there, 5-face in the >10 region and 2-face in the <6 cell.
Now the >10 region has 5 sitting in one cell, so the other cell needs a 6 to clear 10, and the only domino left with a 6-face is the 6|6. That goes in, 6-face completing the sum and the other 6 spilling into the blank cell beside it, which takes anything. That leaves 3|3, 1|1 and 2|4 for the =4 region and the two cells beyond it. The =4 region needs a total of 4 across three cells, and neither the 3|3 (6 on its own) nor the 2|4 (6 on its own) can sit on the two linked cells without already blowing past 4. Only the 1|1 fits there, giving 1+1=2 and leaving exactly 2 still needed from the third cell.
Two dominoes remain, the 3|3 and the 2|4, for the all-equal region and the last two cells. The all-equal region needs matching pips on both its cells, so it has to be the double, the 3|3. That leaves the 2|4 for the final pair: its 2-face lands in the =4 region, bringing that total to 1+1+2=4, and its 4-face lands in the <5 cell, which is happy with 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
Look at the isolated cell in the bottom-right, the <6 cell that only touches one neighbour. Whatever domino sits there also has to drop a face into the >10 region next door. The highest face available is 6, so if the neighbouring >10 cell gets 6, this cell's partner needs to push the pair past 10. Only the 5|2 has a 5 to pair against that 6, with 2 safely under 6 for the <6 cell, so the 5|2 goes there, 5-face in the >10 region and 2-face in the <6 cell.
Hint 2
Now the >10 region has 5 sitting in one cell, so the other cell needs a 6 to clear 10, and the only domino left with a 6-face is the 6|6. That goes in, 6-face completing the sum and the other 6 spilling into the blank cell beside it, which takes anything. That leaves 3|3, 1|1 and 2|4 for the =4 region and the two cells beyond it. The =4 region needs a total of 4 across three cells, and neither the 3|3 (6 on its own) nor the 2|4 (6 on its own) can sit on the two linked cells without already blowing past 4. Only the 1|1 fits there, giving 1+1=2 and leaving exactly 2 still needed from the third cell.
Hint 3
Two dominoes remain, the 3|3 and the 2|4, for the all-equal region and the last two cells. The all-equal region needs matching pips on both its cells, so it has to be the double, the 3|3. That leaves the 2|4 for the final pair: its 2-face lands in the =4 region, bringing that total to 1+1+2=4, and its 4-face lands in the <5 cell, which is happy with 4.
Answer, step by step
The <6 cell in the bottom corner only connects to one neighbour, so trace that domino forward: its other face sits in the >10 region, and the only way to clear 10 there is with a 6 opposite it. With 6 claimed by the other cell in that region, this domino needs a 5, so it has to be the 5|2, with 5 going into the >10 cell and 2 safely under 6 next door. That forces the other >10 cell to take the remaining 6, and the only domino with a 6-face left is the 6|6, its second 6 spilling harmlessly into the blank cell beside it. That leaves 3|3, 1|1 and 2|4 for the =4 region and its neighbours. The two linked cells in the =4 region can't take the 3|3 or the 2|4 without already exceeding the target of 4 on their own, so the 1|1 goes there, giving 1+1=2. The remaining all-equal region needs two matching faces, and the only double left is the 3|3, so that's locked in. That leaves the 2|4 for the final two cells, its 2-face bringing the =4 region to 1+1+2=4 and its 4-face landing on the <5 cell.
About this puzzle
10 cells (4 × 5) · 5 dominoes · 33 pips · 5 ruled regions and 1 free cell · =4, all equal, >10, <5, <6Constructed by Ian Livengood
Where to start: the order the regions give way
- >10top right
- <6top right
- =4bottom left
- all equaltop left
Medium hints and answer for Tuesday, 17 November 2026
The 'all equal' region covers three cells, so two of them have to be filled by a double, since that's the only way to guarantee matching faces before you connect to the third cell. The only double in the set is 4|4, so it has to land on the two adjacent cells in that region, giving them both a value of 4. That leaves the third cell in the region still needing a 4, and the only domino left with a 4-face is 2|4, so it goes down with its 4 touching that cell and its 2 spilling into the neighbouring =2 region.
The =2 region now has one cell filled with a 2, so the other cell needs a 0 to make the total 2. Two dominoes still carry a 0-face: 0|3 and 1|0. If you used 1|0 here, its 1-face would land in the row that needs to sum past 8, and that row would end up short. So it has to be 0|3, with the 0 in the =2 region and the 3 spilling into that sum row. For the >4 region with two cells, 3|1 only sums to 4, which doesn't clear the bar, but 2|3 sums to 5, so that's the one that goes there.
Three dominoes are left for three spots: 3|5, 1|0, and 3|1. The lone cell needing a value above 3 can't take a 1, a 3, or a 0, so it has to be the 5 from 3|5, which pins the 3 into the adjoining sum row. The lone cell needing anything above 0 then takes the 1 from 1|0, pushing its 0 into the blank cell beside it. That leaves 3|1 to fill the last two cells of the sum row, and either way round pushes that row's total past 8.
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 'all equal' region covers three cells, so two of them have to be filled by a double, since that's the only way to guarantee matching faces before you connect to the third cell. The only double in the set is 4|4, so it has to land on the two adjacent cells in that region, giving them both a value of 4. That leaves the third cell in the region still needing a 4, and the only domino left with a 4-face is 2|4, so it goes down with its 4 touching that cell and its 2 spilling into the neighbouring =2 region.
Hint 2
The =2 region now has one cell filled with a 2, so the other cell needs a 0 to make the total 2. Two dominoes still carry a 0-face: 0|3 and 1|0. If you used 1|0 here, its 1-face would land in the row that needs to sum past 8, and that row would end up short. So it has to be 0|3, with the 0 in the =2 region and the 3 spilling into that sum row. For the >4 region with two cells, 3|1 only sums to 4, which doesn't clear the bar, but 2|3 sums to 5, so that's the one that goes there.
Hint 3
Three dominoes are left for three spots: 3|5, 1|0, and 3|1. The lone cell needing a value above 3 can't take a 1, a 3, or a 0, so it has to be the 5 from 3|5, which pins the 3 into the adjoining sum row. The lone cell needing anything above 0 then takes the 1 from 1|0, pushing its 0 into the blank cell beside it. That leaves 3|1 to fill the last two cells of the sum row, and either way round pushes that row's total past 8.
Answer, step by step
The 'all equal' region has three cells, and since only one double sits in this set, that double has to cover two of them: 4|4 goes down, setting two cells in the region to 4. The third cell in that region now needs a matching 4, and the only domino left with that face is 2|4, so it lands there with its 2-face spilling into the neighbouring =2 region. That region already has its 2, so the second cell needs a 0 to total 2. Between 0|3 and 1|0, only 0|3 can go there without stranding the sum row that needs to clear 8, so 0|3 fills that cell with its 3 extending into that row. The remaining two-cell region needing a total above 4 can't be satisfied by 3|1's sum of 4, but 2|3 sums to 5, so that domino goes there. Three dominoes remain for three spots: the cell needing a value above 3 can only take the 5 from 3|5, so that domino drops in with its 3 reaching into the sum row. The cell needing anything above 0 then takes the 1 from 1|0, with its 0 resting in the blank cell next door. The last domino, 3|1, fills the final two cells of the sum row, pushing that row's total well past 8.
About this puzzle
14 cells (4 × 6) · 7 dominoes · 35 pips · 6 ruled regions and 1 free cell · =2, all equal, >8, >0, >3, >4Constructed by Rodolfo Kurchan
Where to start: the order the regions give way
- all equalright
- =2top right
- >8top
- >4bottom
Hard hints and answer for Tuesday, 17 November 2026
The =0 strip along the bottom needs three zero cells, and the 0|0 is the only domino that gives two zeros at once, so it locks onto two of those cells straight away. The third zero cell still needs a 0-face, and checking the neighbouring =8 region rules out a 2|0 or 5|0 there, so it has to be the 0|4, with the 4 spilling into that sum region. In the bottom-right corner, the <3 cell and the =1 cell only work together with the 1|2: the 1 on the =1 cell, the 2 keeping its neighbour under 3. The lone =1 cell in the middle only takes the 1|6, and the <3/=4 pair near the top only fits the 1|4.
Once those corner pieces are down, the all-equal region running down the left-middle needs every one of its four cells at the same value. The 5|5 double sets two of those cells to 5, so the whole chain has to run on 5s. That forces the 4|5 above it, with the 5 feeding the chain and the 4 landing on the >1 cell beside it, and the 6|5 below it, with the 5 feeding the chain and the 6 spilling into the =13 region next door. The =2 cell near the top-left only accepts the 2|0, and the pair of blank cells at the bottom only has the 3|3 left to cover them.
Six dominoes remain for six open spots, and each only fits one way now. The =3 corner takes the 3|0, the only domino left that sums to 3, and the =1 pair nearby takes the 1|0 to make the same total. The =8 region's last two cells need a sum of 4, which only the 1|3 can supply. The all-different pair below the top-left corner needs two unlike values, so the 4|6 goes there, and the =13 region's remaining cells need a sum of 7, which the 3|4 provides. That leaves the 5|0 for the all-different trio at the bottom, giving values of 5 and 0 that differ from each other and from the 6 already sitting there.
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 =0 strip along the bottom needs three zero cells, and the 0|0 is the only domino that gives two zeros at once, so it locks onto two of those cells straight away. The third zero cell still needs a 0-face, and checking the neighbouring =8 region rules out a 2|0 or 5|0 there, so it has to be the 0|4, with the 4 spilling into that sum region. In the bottom-right corner, the <3 cell and the =1 cell only work together with the 1|2: the 1 on the =1 cell, the 2 keeping its neighbour under 3. The lone =1 cell in the middle only takes the 1|6, and the <3/=4 pair near the top only fits the 1|4.
Hint 2
Once those corner pieces are down, the all-equal region running down the left-middle needs every one of its four cells at the same value. The 5|5 double sets two of those cells to 5, so the whole chain has to run on 5s. That forces the 4|5 above it, with the 5 feeding the chain and the 4 landing on the >1 cell beside it, and the 6|5 below it, with the 5 feeding the chain and the 6 spilling into the =13 region next door. The =2 cell near the top-left only accepts the 2|0, and the pair of blank cells at the bottom only has the 3|3 left to cover them.
Hint 3
Six dominoes remain for six open spots, and each only fits one way now. The =3 corner takes the 3|0, the only domino left that sums to 3, and the =1 pair nearby takes the 1|0 to make the same total. The =8 region's last two cells need a sum of 4, which only the 1|3 can supply. The all-different pair below the top-left corner needs two unlike values, so the 4|6 goes there, and the =13 region's remaining cells need a sum of 7, which the 3|4 provides. That leaves the 5|0 for the all-different trio at the bottom, giving values of 5 and 0 that differ from each other and from the 6 already sitting there.
Answer, step by step
The =0 strip at the bottom needs three zero cells, and only the 0|0 can give two zeros at once, so it covers the middle and right cells there. That leaves the third zero cell needing another 0-face, and checking the neighbouring =8 region rules out the 2|0 and 5|0, so the 0|4 fills it, with the 4 spilling into that sum region. The bottom-right corner's <3 cell and =1 cell only accept the 1|2 together: the 1 on the =1 cell, the 2 keeping the neighbour under 3. The lone =1 cell in the middle only takes the 1|6, and the <3/=4 pair up top only works with the 1|4. With those down, the all-equal region in the left-middle needs every cell at the same value. The 5|5 double sets two of its cells to 5, so the whole chain has to run on 5s. That forces the 4|5 above it, with the 5-face feeding the chain and the 4 landing on the >1 cell beside it, and the 6|5 below it, with the 5-face feeding the chain and the 6 spilling into the =13 region. The =2 cell near the top-left only takes the 2|0, and the blank pair at the bottom only has the 3|3 left to cover it. That leaves six dominoes for six open spots, and each only fits one way. The =3 corner takes the 3|0, since that's the only domino left summing to 3. The =1 pair near the bottom-left takes the 1|0, summing to 1. The =8 region's last two cells need a sum of 4, and the 1|3 does it. The all-different pair below the top-left corner takes the 4|6, since 4 and 6 are the only values left that differ. The =13 region's last two cells need a sum of 7, and the 3|4 does it. The last domino, 5|0, fills the remaining two cells of the all-different trio at the bottom, giving 5 and 0, both different from the 6 already placed there and from each other.
About this puzzle
32 cells (9 × 8) · 16 dominoes · 87 pips · 15 ruled regions and 3 free cells · =3, >1, <3, all equal, =4, =2, =13, all different, =1, =8, =0Constructed by Rodolfo Kurchan
Where to start: the order the regions give way
- =0bottom
- <3top right
- =1top right
- =8bottom
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.