NYT Pips Hints & Answers: Saturday, 4 July 2026
Hints and full solutions for Easy, Medium and Hard.
Easy hints and answer for Saturday, 4 July 2026
The =3 single cell needs a domino with a 3-face on it. The 0|3 would work there, but then the 0-face lands in the 'all equal' region, and the only domino left to pair with it there wouldn't match. The 3|2 is the only option that leaves the rest of the grid workable, so its 3-face goes on the =3 cell with the 2 extending into the 'all equal' region next door.
Look at the =2 cell tucked in the corner below the =3 region. Only one domino has a 2-face that can reach it: the 2|1. That forces the 1|1 into the remaining =3 cells above it, since 1+1=3 matches the region exactly.
Now check the =4 region. It needs two faces summing to 4, and only the 4|2 domino can supply that with its 4-face and 2-face together. That leaves the 0|3 for the last two cells, with its 3-face and 0-face covering the =4 region's neighbour and the blank cell beyond it.
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 single cell needs a domino with a 3-face on it. The 0|3 would work there, but then the 0-face lands in the 'all equal' region, and the only domino left to pair with it there wouldn't match. The 3|2 is the only option that leaves the rest of the grid workable, so its 3-face goes on the =3 cell with the 2 extending into the 'all equal' region next door.
Hint 2
Look at the =2 cell tucked in the corner below the =3 region. Only one domino has a 2-face that can reach it: the 2|1. That forces the 1|1 into the remaining =3 cells above it, since 1+1=3 matches the region exactly.
Hint 3
Now check the =4 region. It needs two faces summing to 4, and only the 4|2 domino can supply that with its 4-face and 2-face together. That leaves the 0|3 for the last two cells, with its 3-face and 0-face covering the =4 region's neighbour and the blank cell beyond it.
Answer, step by step
The =3 single cell needs a 3-face, and testing the 0|3 there causes a clash in the 'all equal' region next door, so the 3|2 goes there instead, with its 2 spilling into the 'all equal' cells. That means the =2 corner cell below can only take the 2|1, since no other domino has a spare 2-face reaching it. Which forces the 1|1 into the remaining =3 cells above, as 1+1=3 satisfies that region exactly. That leaves the =4 region needing a 4 and a 2 together, so the 4|2 fills those two cells. Finally the 0|3 covers what's left, with its 3-face landing in the =4 region's neighbour and its 0-face resting in the blank cell beyond.
About this puzzle
10 cells (3 × 5) · 5 dominoes · 19 pips · 5 ruled regions and 1 free cell · =3, all equal, =4, =2Constructed by Ian Livengood
Where to start: the order the regions give way
- all equaltop
- =3middle
- =3top left
- =2bottom left
Medium hints and answer for Saturday, 4 July 2026
That top-left 'all equal' region needs a double, and it also has a spare cell that a second domino must reach from outside. Try the 0|1 or 2|0 there instead: either one dumps a stray value into the equal cells that doesn't match its own double face, breaking the rule. The only double that can sit across two of those cells while leaving the third open to a matching neighbour is the 2|2, so that goes in the top-left corner. Down at the other equal region, only the 3|3 has both faces free to cover its two cells, so that's forced too. That leaves the =4 cell needing a domino with a 4-face, and tracing through what's left, only the 5|4 can reach it without stranding the 5 somewhere it doesn't belong.
Check the cell below the 5|4 you just placed: the only domino left with a 0-face and a 5-face free to land there is the 0|5, so that fills the =10 region's first two cells. The >4 cell in the top row needs something bigger than 4, and of the remaining dominoes only the 2|6 has a face high enough, so its 6 goes there with the 2 spilling into the =4 pair below it. Over on the right edge, the <1 cell can only take a 0, and the only domino with a free 0-face left is the 0|1, so that closes out that corner.
Now look at the lone cell in the 'all equal' region near the top-left: only the 2|0 has a face that can reach it, so that domino has to go there, with its 2-face landing on the region you started with. Over on the right, the =4 region still needs one more face to hit its total, and only the 2|1 has a 2-face free to complete it, so that's forced into place. That leaves the 4|6 for the =10 region's last two cells: its 4-face and 6-face together bring that region's sum to 10, closing out the grid.
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
That top-left 'all equal' region needs a double, and it also has a spare cell that a second domino must reach from outside. Try the 0|1 or 2|0 there instead: either one dumps a stray value into the equal cells that doesn't match its own double face, breaking the rule. The only double that can sit across two of those cells while leaving the third open to a matching neighbour is the 2|2, so that goes in the top-left corner. Down at the other equal region, only the 3|3 has both faces free to cover its two cells, so that's forced too. That leaves the =4 cell needing a domino with a 4-face, and tracing through what's left, only the 5|4 can reach it without stranding the 5 somewhere it doesn't belong.
Hint 2
Check the cell below the 5|4 you just placed: the only domino left with a 0-face and a 5-face free to land there is the 0|5, so that fills the =10 region's first two cells. The >4 cell in the top row needs something bigger than 4, and of the remaining dominoes only the 2|6 has a face high enough, so its 6 goes there with the 2 spilling into the =4 pair below it. Over on the right edge, the <1 cell can only take a 0, and the only domino with a free 0-face left is the 0|1, so that closes out that corner.
Hint 3
Now look at the lone cell in the 'all equal' region near the top-left: only the 2|0 has a face that can reach it, so that domino has to go there, with its 2-face landing on the region you started with. Over on the right, the =4 region still needs one more face to hit its total, and only the 2|1 has a 2-face free to complete it, so that's forced into place. That leaves the 4|6 for the =10 region's last two cells: its 4-face and 6-face together bring that region's sum to 10, closing out the grid.
Answer, step by step
That top-left 'all equal' region needs a double, and it also has a spare cell that a second domino must reach from outside. Try the 0|1 or 2|0 there instead: either one dumps a stray value into the equal cells that doesn't match its own double face, breaking the rule. The only double that can sit across two of those cells while leaving the third open to a matching neighbour is the 2|2, so that goes in the top-left corner. Down at the other equal region, only the 3|3 has both faces free to cover its two cells, so that's forced too. That leaves the =4 cell needing a domino with a 4-face, and tracing through what's left, only the 5|4 can reach it without stranding the 5 somewhere it doesn't belong. Check the cell below the 5|4 you just placed: the only domino left with a 0-face and a 5-face free to land there is the 0|5, so that fills the =10 region's first two cells. The >4 cell in the top row needs something bigger than 4, and of the remaining dominoes only the 2|6 has a face high enough, so its 6 goes there with the 2 spilling into the =4 pair below it. Over on the right edge, the <1 cell can only take a 0, and the only domino with a free 0-face left is the 0|1, so that closes out that corner. Now look at the lone cell in the 'all equal' region near the top-left: only the 2|0 has a face that can reach it, so that domino has to go there, with its 2-face landing on the region you started with. Over on the right, the =4 region still needs one more face to hit its total, and only the 2|1 has a 2-face free to complete it, so that's forced into place. That leaves the 4|6 for the =10 region's last two cells: its 4-face and 6-face together bring that region's sum to 10, closing out the grid.
About this puzzle
18 cells (4 × 7) · 9 dominoes · 48 pips · 10 ruled regions · all equal, =4, >4, <2, =10, <1Constructed by Ian Livengood
Where to start: the order the regions give way
- all equaltop left
- all equalbottom left
- all equaltop
- =4top
Hard hints and answer for Saturday, 4 July 2026
The =5 cell next to the =2 cell needs faces summing to those exact values, and only the 5|2 domino has both a 5 and a 2 available to split across them, so that one's locked. Down at the bottom-left corner, the =5 cell paired with the =0 cell beneath it only works with the 5|0 domino, since nothing else offers both faces. Along the top-right, the two =4 cells (well, one =7 pair and one =4 single) only accept the 2|4 domino once you check which faces are left, and that same logic forces the 5|3 into the =7 pair next to the 'all equal' column, with its 3 starting that column off. That 3 then demands a matching 3 for the 'all equal' region below it, and the only double left that can reach is the 3|3.
Look at the blank cells sitting beside the =0 region: with the =0 cell needing a 0-face and its neighbour unconstrained, the only domino left offering a 0 is the 0|0, so that's forced across both. Nearby, the =7 pair next to the isolated blank cell only has the 6|0 domino left that can supply a 7 while dumping its 0 into the blank space. That leaves the 'all equal' column needing one more matching face, which only the 1|3 can provide, and the last =4 pair takes the 4|4 domino since it's the only double remaining with two 4s. With those five down, the top-left =4 cell only has the 1|4 domino left to give it a 4, sending the 1 into the neighbouring =7 region.
Just five dominoes remain for five gaps, so trace it through: the top-left =7 pair still needs a 7 total, and once you've placed the 1 there from the =4 cell's leftover, only the 6|4 domino can complete that pair with its 6-face. The bottom-left =2 cell then only has the 1|2 domino left to supply its 2, pushing the 1 into the corner. That corner and its neighbour form the last =7 pair using the leftover 1|6, and the two remaining >4 cells only fit the 5|6 and 6|2 dominoes, with the 6 faces landing on the >4 cells to satisfy both.
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 =5 cell next to the =2 cell needs faces summing to those exact values, and only the 5|2 domino has both a 5 and a 2 available to split across them, so that one's locked. Down at the bottom-left corner, the =5 cell paired with the =0 cell beneath it only works with the 5|0 domino, since nothing else offers both faces. Along the top-right, the two =4 cells (well, one =7 pair and one =4 single) only accept the 2|4 domino once you check which faces are left, and that same logic forces the 5|3 into the =7 pair next to the 'all equal' column, with its 3 starting that column off. That 3 then demands a matching 3 for the 'all equal' region below it, and the only double left that can reach is the 3|3.
Hint 2
Look at the blank cells sitting beside the =0 region: with the =0 cell needing a 0-face and its neighbour unconstrained, the only domino left offering a 0 is the 0|0, so that's forced across both. Nearby, the =7 pair next to the isolated blank cell only has the 6|0 domino left that can supply a 7 while dumping its 0 into the blank space. That leaves the 'all equal' column needing one more matching face, which only the 1|3 can provide, and the last =4 pair takes the 4|4 domino since it's the only double remaining with two 4s. With those five down, the top-left =4 cell only has the 1|4 domino left to give it a 4, sending the 1 into the neighbouring =7 region.
Hint 3
Just five dominoes remain for five gaps, so trace it through: the top-left =7 pair still needs a 7 total, and once you've placed the 1 there from the =4 cell's leftover, only the 6|4 domino can complete that pair with its 6-face. The bottom-left =2 cell then only has the 1|2 domino left to supply its 2, pushing the 1 into the corner. That corner and its neighbour form the last =7 pair using the leftover 1|6, and the two remaining >4 cells only fit the 5|6 and 6|2 dominoes, with the 6 faces landing on the >4 cells to satisfy both.
Answer, step by step
The =5 and =2 cells sitting together only accept the 5|2 domino, since it's the only piece with both faces free, so place it there straight away. The bottom-left =5 and =0 pair works the same way: only the 5|0 domino has both faces available, so that's forced too. Up at the top-right, the =7 pair takes the 2|4 domino, and that leaves the 5|3 domino as the only option for the neighbouring =7 pair, with its 3-face starting the 'all equal' column. That 3 forces the 3|3 domino into the next two cells of that column to keep everything matching. Now the =0 cell beside the blank cell only has the 0|0 domino left to supply its 0, so place that across both. The =7 pair next to the last blank cell then only fits the 6|0 domino, with the 0 spilling harmlessly into the blank space. The 'all equal' column's final cell only takes the 1|3 domino to keep the run consistent, and the remaining =4 pair takes the 4|4 domino since it's the only double left with two 4s. That leaves the top-left =4 cell short a face, and only the 1|4 domino can give it a 4, sending its 1 into the adjacent =7 region. That =7 pair now only needs a 6 to finish, which only the 6|4 domino can supply. Down at the =2 cell, only the 1|2 domino remains to complete it, pushing its 1 into the corner. That corner pairs with its neighbour to complete the final =7 region using the leftover 1|6 domino. Finally, the two >4 cells take the 5|6 and 6|2 dominoes, with their 6-faces landing exactly where the >4 constraint needs them.
About this puzzle
30 cells (5 × 9) · 15 dominoes · 94 pips · 20 ruled regions and 2 free cells · =7, =4, >0, =2, >4, all equal, =5, =0Constructed by Rodolfo Kurchan
Where to start: the order the regions give way
- =2top
- =5middle
- =5bottom left
- =0bottom 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.