🚨 SPOILER WARNING
This page contains the final **answer** and the complete **solution** to today's NYT Pips puzzle. If you haven't attempted the puzzle yet and want to try solving it yourself first, now's your chance!
Click here to play today's official NYT Pips game first.
Want hints instead? Scroll down for progressive clues that won't spoil the fun.
🎲 Today's Puzzle Overview
Thursday's Pips features a familiar pairing: Ian Livengood constructs both the Easy and Medium puzzles, while Rodolfo Kurchan handles the Hard. Livengood is a reliable architect of tightly chained constraint logic — his grids tend to funnel solvers toward one inevitable starting point, then let the rest unravel on its own.
The Easy puzzle is a compact cross-shaped grid with just four dominoes. Its decisive constraint lives at the bottom of the grid, where a pair of cells must produce a sum that's nearly impossible to satisfy in more than one way. Crack that, and the whole puzzle collapses in a clean chain upward.
Kurchan's Hard puzzle is the sprawling counterpart — eight rows, nine columns, fifteen dominoes spread across a grid with multiple isolated entry points. No single anchor unlocks everything at once; instead, a cluster of pinned cells scattered across the board each feed a nearby region, and those regions eventually converge into one continuous deduction chain that clears the grid.
💡 Progressive Hints
Try these hints one at a time. Each hint becomes more specific to help you solve it yourself!
💡 The bottom constraint unlocks everything
There's a two-cell region near the bottom of the grid with a sum threshold that's very hard to satisfy in more than one way. Think about the highest possible pip value and what two cells would need to hold to clear that bar. Those values are your starting point.
💡 No double-six means two separate dominoes, and the chain flows upward
Once you've established both bottom values, notice there's no 6-6 domino in today's set — so each of those cells belongs to a different piece. Each domino extends vertically into the middle row, and one of those middle-row values triggers the equals constraint linking two cells in the upper portion of the grid.
💡 Full solution
Region [2,1]+[2,2] must exceed 11. With a pip cap of 6, the only option is 6+6=12. There's no 6-6 domino in the set, so the sixes come from separate pieces: the 6-0 domino runs vertically at [2,1][1,1] (6 below, 0 above), and the 2-6 domino runs vertically at [1,2][2,2] (2 above, 6 below). The equals region [0,2][1,2] now requires [0,2]=2. Row 0 splits into two horizontal dominoes: the right pair covers [0,2][0,3], and with [0,2]=2 and [0,3] needing to be less than 4, the 3-2 domino fits perfectly (2 at [0,2], 3 at [0,3]). The last domino, 2-5, fills [0,0][0,1] with 5 at [0,0] — satisfying the greater-than-4 constraint.
💡 Greater-than-11 with a max pip of 6 — only one answer
The two-cell sum constraint at the bottom of the grid has an unusually tight threshold. Run through the arithmetic: how many pairs of numbers from 0 to 6 can actually produce a sum over 11? There's only one pair, and it determines both cells immediately.
💡 Two locked sixes force two vertical dominoes
Both bottom cells must be 6. Since there's no 6-6 domino in the set, each 6 belongs to a separate piece running vertically. Identify which two dominoes carry a 6, place them accordingly, and note what values they deposit in the middle row. One of those values feeds directly into the equals region above it.
💡 Full solution
Both [2,1] and [2,2] must be 6 (only 6+6=12 clears the >11 threshold). The 6-0 domino goes vertically at [2,1][1,1] (6, 0) and the 2-6 domino goes vertically at [1,2][2,2] (2, 6). With [1,2]=2, the equals constraint forces [0,2]=2. The 3-2 domino fills [0,2][0,3] horizontally (2 left, 3 right — 3 < 4 satisfies the upper-right constraint). The remaining 2-5 domino fills [0,0][0,1] with 5 at [0,0] (5 > 4) and 2 at [0,1].
💡 The bottom sum constraint is mathematically pinned
Region [2,1]+[2,2] must be strictly greater than 11. Given that pip values range from 0 to 6, there is exactly one pair of values that satisfies this. Find that pair — both cells are determined instantly, no guessing required.
💡 No 6-6 domino forces vertical placement; the equals constraint does the rest
With both bottom cells at 6, scan the domino list. There's no 6-6 piece, so the two sixes come from different dominoes placed vertically. Each domino's upper half lands in the middle row — those values are fixed too. One of them matches what the equals region [0,2][1,2] needs, locking in cell [0,2] without any calculation.
💡 Full solution
[2,1]+[2,2] > 11 forces both to 6. No 6-6 domino exists, so: 6-0 placed vertically at [2,1][1,1] (6 and 0), and 2-6 placed vertically at [1,2][2,2] (2 and 6). Equals region [0,2]=[1,2]=2 locks [0,2]=2. The 3-2 domino spans [0,2][0,3] (2, 3) — 3 < 4 confirmed. The 2-5 domino fills [0,0][0,1] with 5 at [0,0] — 5 > 4 confirmed.
🎨 Pips Solver
Mar 26, 2026
Click a domino to place it on the board. You can also click the board, and the correct domino will appear.
✅ Final Answer & Complete Solution For Hard Level
The key to solving today's hard puzzle was identifying the placement for the critical dominoes highlighted in the starting grid. Once those were in place, the rest of the puzzle could be solved logically. See the final grid below to compare your solution.
Starting Position & Key First Steps
This image shows the initial puzzle grid for the hard level, with a few critical first placements highlighted.
Final Answer: The Solved Grid for Hard Mode
Compare this final grid with your own solution to see the correct placement of all dominoes.
🔧 Step-by-Step Answer Walkthrough For Easy Level
1
Step 1: The bottom sum forces both values
Region [2,1]+[2,2] must be greater than 11. The maximum pip on any domino face is 6, and 6+6=12 is the only pair that clears the threshold. Both bottom cells are 6.
2
Step 2: Place the two vertical dominoes
There's no 6-6 double in today's set, so the two sixes belong to separate pieces. The 6-0 domino runs vertically at [2,1][1,1], putting 6 in the lower cell and 0 above it. The 2-6 domino runs vertically at [1,2][2,2], putting 2 in the upper cell and 6 below.
3
Step 3: Resolve the equals pair
The equals constraint links [0,2] and [1,2]. With [1,2] now set to 2 from the previous step, [0,2] must also carry a 2. Both cells are confirmed.
4
Step 4: Fill the right side of row 0
The top row holds two horizontal dominoes laid side by side. The right pair covers [0,2] and [0,3]. With [0,2]=2 established, the other half at [0,3] must be less than 4. The 3-2 domino fits cleanly: 2 at [0,2] and 3 at [0,3]. Three is less than four — constraint satisfied.
5
Step 5: Place the final domino
The 2-5 domino is all that remains. It fills [0,0] and [0,1], and cell [0,0] must be greater than 4. Placing 5 at [0,0] satisfies that requirement, with 2 landing at [0,1]. The puzzle is complete.
🔧 Step-by-Step Answer Walkthrough For Medium Level
1
Step 1: Anchor the bottom equals column
The equals region [3,2]=[4,2] covers two vertically adjacent cells that must match. The only domino in the set with two identical pip values that can span those cells is the 2-2 double — place it vertically at [3,2][4,2], setting both cells to 2.
2
Step 2: Satisfy the lower-right greater-than constraint
Cell [4,3] must exceed 4, so it holds a 5 or 6. The domino that covers [4,3] connects upward to [3,3]. The 1-5 piece works: place it vertically at [3,3][4,3] with 1 at [3,3] and 5 at [4,3]. That 5 clears the greater-than-4 requirement.
3
Step 3: Chain the equals constraints upward
The equals region [2,3]=[3,3] requires [2,3] to match [3,3]=1. The 3-1 domino fits horizontally at [2,2][2,3] — 3 at [2,2] and 1 at [2,3]. Then the equals region [1,2]=[2,2] requires [1,2] to match [2,2]=3. The 3-3 double drops horizontally at [1,1][1,2], setting both cells to 3.
4
Step 4: Resolve the sum pair at the top-left
Region [0,1]+[1,1] must equal 3. With [1,1]=3 already in place, [0,1] must be 0. The 0-0 double fills [0,0][0,1] horizontally — 0 at both cells, satisfying the sum constraint.
5
Step 5: Place the right-side dominoes
Region [0,4]+[1,3]+[1,4] must sum to 12. The 0-6 domino delivers 6 at [1,3] and 0 at [1,4], contributing 6 to the region's total. That means [0,4] must supply the remaining 6. The 5-6 domino goes horizontally at [0,4][0,5] with 6 at [0,4] and 5 at [0,5]. Cell [0,5]=5 satisfies the greater-than-4 constraint. Sum check: 6+6+0=12.
🔧 Step-by-Step Answer Walkthrough For Hard Level
1
Step 1: Lock in the single-cell anchors
Three cells carry absolute constraints with no ambiguity. Cell [1,0] must be 1 (sum=1). Cells [7,3] and [7,6] must each be 5 (sum=5 each). Record all three before placing anything — they each determine a domino immediately.
2
Step 2: Fill the far-right column with sixes
Region [3,8]+[4,8]+[5,8] must sum to 18. Three cells, max pip of 6: the only solution is 6+6+6. The 6-6 double covers [4,8][5,8]. The 2-6 domino places 6 at [3,8] and 2 at [3,7]. All three right-column cells are now set.
3
Step 3: Anchor the bottom-right corner
Cell [6,6] must be less than 2 — so 0 or 1. With [7,6]=5 established, the 0-5 domino fits vertically at [6,6][7,6]: 0 at [6,6] and 5 at [7,6].
4
Step 4: Set the lower column 3 values
With [7,3]=5, place the 5-6 domino vertically at [7,3][6,3]: 5 at [7,3] and 6 at [6,3]. Now region [4,3]+[5,3]+[6,3] sums to 15 with [6,3]=6 contributing — so [4,3]+[5,3] must equal 9.
5
Step 5: Work inward through the sum chain
Region [3,6]+[3,7] must sum to 8. With [3,7]=2 placed earlier, [3,6]=6. The 3-6 domino goes vertically at [4,6][3,6]: 3 at [4,6], 6 at [3,6]. Region [4,6]+[5,6] must sum to 7: with [4,6]=3, [5,6]=4. The 2-4 domino goes horizontally at [5,5][5,6]: 2 at [5,5], 4 at [5,6]. Region [5,4]+[5,5] must sum to 4: with [5,5]=2, [5,4]=2. The 2-5 domino goes horizontally at [5,4][5,3]: 2 at [5,4], 5 at [5,3]. Single-cell [4,4]=3, so the 3-4 domino goes horizontally at [4,4][4,3]: 3 at [4,4], 4 at [4,3]. Sum check for column 3: 4+5+6=15.
6
Step 6: Resolve the four-cell equals region
Region [2,4],[3,2],[3,3],[3,4] must all carry the same value. Cells [3,3] and [3,4] are adjacent — the only unused double that works here is the 0-0 domino, placing 0 at both. With the shared value established as 0, [3,2]=0 and [2,4]=0 follow. The 0-4 domino goes vertically at [3,2][2,2]: 0 at [3,2], 4 at [2,2]. The 0-1 domino goes horizontally at [2,4][2,5]: 0 at [2,4], 1 at [2,5].
7
Step 7: Complete the equals column and upper grid
Region [2,5],[3,5],[4,5] all equal the same value. With [2,5]=1 just placed, all three cells are 1. The 1-1 double goes vertically at [3,5][4,5]. With [1,0]=1, the 1-2 domino goes vertically at [1,0][2,0]: 1 at [1,0], 2 at [2,0]. Region [2,0]+[2,1]+[2,2] must sum to 8: with [2,0]=2 and [2,2]=4, [2,1] must be 2. The 2-3 domino goes vertically at [2,1][1,1]: 2 at [2,1], 3 at [1,1]. The equals region [0,2],[1,1],[1,2] must all be 3. With [1,1]=3, [0,2] and [1,2] are both 3. The 3-3 double goes vertically at [0,2][1,2], completing the puzzle.
💡 Pro Tips for Similar Puzzles
Start with Constraints
Always begin with the most constrained regions - sum regions with small numbers or tight spaces.
Use Equal Regions
Use "equal" regions as anchors - they eliminate many possibilities quickly.
Work Systematically
Let the rules guide your placement rather than guessing randomly.
Double-Check
Verify each region's rules are satisfied before moving to the next.
💬 Community Discussion
Leave your comment