NYT Pips Answers for October 16, 2026
NYT Pips answers for October 16, 2026, a Friday: hints first, then the full solution for the easy, medium and hard boards. Take the hints in order and stop when you have enough — nothing below is revealed until you open it.
Today's set runs from a 10-square easy board to a 28-square hard one, a gap of 18 squares, with the hard board carrying 3 doubles against easy's 1 and 7 loose regions against 2. Constructed by Ian Livengood and Rodolfo Kurchan. Edited by Ian Livengood.
By Sukie · Puzzle editor
Easy — 10 squares, 5 dominoes
A 10-square board across 5 regions, with 1 exact sum to anchor it and 2 looser regions to work around.
At 10 squares this is a typical easy board — the average is 9.9 — so nothing about its size explains an unusually long or short solve.
The rule mix is 1 exact sum, 2 all-equal, 1 comparison, 1 with no rule at all across 5 regions. The unconstrained regions are the ones worth noticing: they look like free squares and are actually the reason the rest of the board has to carry more weight.
Nothing here is far enough from the easy norm to explain an unusually fast or slow solve, which makes it a good board to practise the standard opening on: bound the exact sums first, work out where the doubles cannot go, then check for an orphan square before you touch a comparison region.
Where the information is on this board
Ordered from most constrained to least — which is the order worth working them in. No values are given away here, only how much each region can tell you.
- = 5 (the middle centre row of 2) — the pips in this region must add up to exactly 5. 3 combinations of values would satisfy it in isolation.
- > 1 (the bottom centre single square) — the pips in this region must add up to more than 1. 5 combinations of values would satisfy it in isolation.
- no rule (the top right single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
- = (the middle centre row of 2) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
- = (the middle left 4-square block) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
Hint 1 — where to start
Start with the = 5 region — the middle centre row of 2 — where the pips in this region must add up to exactly 5. Work there first because only 3 combinations of values can fill it.
Hint 2 — what your tray forces
The tray carries 1 double: 4-4. A double is the only tile that fits wholly inside an all-equal region, and there are 2 here.
Hint 3 — the opening region's values
The = 5 region resolves to 2, 3. Which half of which domino supplies each is still yours to work out.
Full answer — easy board, October 16, 2026
| Region | Where | Values |
|---|---|---|
| no rule | the top right single square | 1 |
| = 5 | the middle centre row of 2 | 3, 2 |
| = | the middle centre row of 2 | 5, 5 |
| = | the middle left 4-square block | 4, 4, 4, 4 |
| > 1 | the bottom centre single square | 6 |
Every tile and the squares it covers
- 3-5 → row 2 col 3 and row 3 col 3
- 5-4 → row 3 col 2 and row 4 col 2
- 6-4 → row 5 col 3 and row 5 col 2
- 4-4 → row 4 col 1 and row 5 col 1
- 2-1 → row 2 col 4 and row 1 col 4
Rows and columns are counted from the top-left of the board, starting at 1.
Medium — 14 squares, 7 dominoes
Two or more regions carry no rule at all today, which sounds generous and is not: unconstrained squares give you nothing to reason from, so the 2 sum regions have to carry the whole board.
At 14 squares this is a typical medium board — the average is 14.7 — so nothing about its size explains an unusually long or short solve.
80% of its regions are loose against a norm of 42%, so this board is vaguer than usual — there is less exact arithmetic to anchor on and more reasoning by elimination.
Its tightest sum target is 1, against a median of 5 across every board published. A target that low forces blanks and low values, and is usually the fastest way in.
Where the information is on this board
Ordered from most constrained to least — which is the order worth working them in. No values are given away here, only how much each region can tell you.
- < 1 (the top centre single square) — the pips in this region must add up to less than 1 — and exactly one combination of values satisfies it, so it is forced.
- = 1 (the middle left column of 2) — the pips in this region must add up to exactly 1 — and exactly one combination of values satisfies it, so it is forced.
- < 1 (the bottom right single square) — the pips in this region must add up to less than 1 — and exactly one combination of values satisfies it, so it is forced.
- = 3 (the middle centre row of 2) — the pips in this region must add up to exactly 3. 2 combinations of values would satisfy it in isolation.
- > 3 (the bottom centre single square) — the pips in this region must add up to more than 3. 3 combinations of values would satisfy it in isolation.
- > 2 (the middle right single square) — the pips in this region must add up to more than 2. 4 combinations of values would satisfy it in isolation.
- > 9 (the middle centre row of 2) — the pips in this region must add up to more than 9. 4 combinations of values would satisfy it in isolation.
- > 9 (the middle centre row of 2) — the pips in this region must add up to more than 9. 4 combinations of values would satisfy it in isolation.
- no rule (the middle centre single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
- no rule (the bottom centre single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
Hint 1 — where to start
Start with the < 1 region — the top centre single square — where the pips in this region must add up to less than 1. Work there first because exactly one combination of values can fill it, so it is fully forced before you place anything.
Hint 2 — what your tray forces
The tray carries 1 double: 5-5. Neither all-equal nor all-different regions appear today, so the doubles are unusually free — place them last.
Hint 3 — the opening region's values
The < 1 region resolves to 0. Which half of which domino supplies each is still yours to work out.
Full answer — medium board, October 16, 2026
| Region | Where | Values |
|---|---|---|
| < 1 | the top centre single square | 0 |
| no rule | the middle centre single square | 4 |
| = 3 | the middle centre row of 2 | 2, 1 |
| > 2 | the middle right single square | 4 |
| = 1 | the middle left column of 2 | 1, 0 |
| > 9 | the middle centre row of 2 | 5, 5 |
| > 9 | the middle centre row of 2 | 5, 5 |
| > 3 | the bottom centre single square | 4 |
| no rule | the bottom centre single square | 3 |
| < 1 | the bottom right single square | 0 |
Every tile and the squares it covers
- 1-5 → row 3 col 1 and row 3 col 2
- 5-4 → row 3 col 5 and row 2 col 5
- 4-2 → row 2 col 2 and row 2 col 3
- 5-5 → row 3 col 3 and row 3 col 4
- 0-3 → row 4 col 5 and row 4 col 4
- 4-0 → row 4 col 2 and row 4 col 1
- 1-0 → row 2 col 4 and row 1 col 4
Rows and columns are counted from the top-left of the board, starting at 1.
Hard — 28 squares, 14 dominoes
Two or more regions carry no rule at all today, which sounds generous and is not: unconstrained squares give you nothing to reason from, so the 8 sum regions have to carry the whole board.
At 28 squares this is a typical hard board — the average is 26.4 — so nothing about its size explains an unusually long or short solve.
41% of its regions are loose against a norm of 28%, so this board is vaguer than usual — there is less exact arithmetic to anchor on and more reasoning by elimination.
Its tightest sum target is 0, against a median of 4 across every board published. A target that low forces blanks and low values, and is usually the fastest way in.
Where the information is on this board
Ordered from most constrained to least — which is the order worth working them in. No values are given away here, only how much each region can tell you.
- = 4 (the top centre single square) — the pips in this region must add up to exactly 4 — and exactly one combination of values satisfies it, so it is forced.
- = 1 (the middle left single square) — the pips in this region must add up to exactly 1 — and exactly one combination of values satisfies it, so it is forced.
- = 6 (the middle centre single square) — the pips in this region must add up to exactly 6 — and exactly one combination of values satisfies it, so it is forced.
- = 5 (the middle left single square) — the pips in this region must add up to exactly 5 — and exactly one combination of values satisfies it, so it is forced.
- = 1 (the middle left single square) — the pips in this region must add up to exactly 1 — and exactly one combination of values satisfies it, so it is forced.
- = 0 (the bottom left single square) — the pips in this region must add up to exactly 0 — and exactly one combination of values satisfies it, so it is forced.
- = 2 (the bottom centre single square) — the pips in this region must add up to exactly 2 — and exactly one combination of values satisfies it, so it is forced.
- = 2 (the middle centre column of 2) — the pips in this region must add up to exactly 2. 2 combinations of values would satisfy it in isolation.
- no rule (the top left single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
- = (the top centre column of 3) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
- no rule (the middle centre single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
- = (the middle centre 4-square block) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
- no rule (the middle left single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
- no rule (the middle centre single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
- ≠ (the middle centre column of 2) — no two pip values in this region may be the same. 21 combinations of values would satisfy it in isolation.
- > 9 (the middle centre column of 3) — the pips in this region must add up to more than 9. 38 combinations of values would satisfy it in isolation.
- > 8 (the top right column of 3) — the pips in this region must add up to more than 8. 46 combinations of values would satisfy it in isolation.
Hint 1 — where to start
Start with the = 4 region — the top centre single square — where the pips in this region must add up to exactly 4. Work there first because exactly one combination of values can fill it, so it is fully forced before you place anything.
Hint 2 — what your tray forces
The tray carries 3 doubles: 5-5, 1-1, 0-0. With 1 all-different and 2 all-equal regions on the board, those doubles are barred from the former and are the only tiles that fit wholly inside the latter — which usually pins two of them before you make a real decision.
Hint 3 — the opening region's values
The = 4 region resolves to 4. Which half of which domino supplies each is still yours to work out.
Full answer — hard board, October 16, 2026
| Region | Where | Values |
|---|---|---|
| no rule | the top left single square | 2 |
| = 4 | the top centre single square | 4 |
| = | the top centre column of 3 | 0, 0, 0 |
| > 8 | the top right column of 3 | 3, 2, 4 |
| = 1 | the middle left single square | 1 |
| = 6 | the middle centre single square | 6 |
| = 2 | the middle centre column of 2 | 1, 1 |
| = 5 | the middle left single square | 5 |
| ≠ | the middle centre column of 2 | 2, 4 |
| no rule | the middle centre single square | 3 |
| = 1 | the middle left single square | 1 |
| > 9 | the middle centre column of 3 | 3, 4, 3 |
| = | the middle centre 4-square block | 5, 5, 5, 5 |
| no rule | the middle left single square | 1 |
| no rule | the middle centre single square | 1 |
| = 0 | the bottom left single square | 0 |
| = 2 | the bottom centre single square | 2 |
Every tile and the squares it covers
- 5-5 → row 5 col 7 and row 6 col 7
- 4-3 → row 5 col 4 and row 6 col 4
- 3-2 → row 1 col 7 and row 2 col 7
- 0-1 → row 6 col 1 and row 5 col 1
- 1-2 → row 5 col 2 and row 6 col 2
- 4-5 → row 3 col 7 and row 4 col 7
- 2-6 → row 3 col 2 and row 2 col 2
- 1-5 → row 2 col 1 and row 3 col 1
- 1-1 → row 2 col 5 and row 3 col 5
- 0-0 → row 1 col 4 and row 2 col 4
- 3-0 → row 4 col 4 and row 3 col 4
- 4-1 → row 4 col 2 and row 4 col 1
- 3-5 → row 3 col 6 and row 4 col 6
- 2-4 → row 1 col 1 and row 1 col 2
Rows and columns are counted from the top-left of the board, starting at 1.
Questions about this day
- What is the answer to NYT Pips on October 16, 2026?
- The full solution for all three boards is on this page, below the hints. Two or more regions carry no rule at all today, which sounds generous and is not: unconstrained squares give you nothing to reason from, so the 8 sum regions have to carry the whole board.
- Can I see a hint without seeing the whole answer?
- Yes. Each difficulty has three hints in order — where to start, what your tray forces, then the values in the opening region — each behind its own disclosure, with the full solution last. Nothing is revealed until you open it.
- Are these the official New York Times boards?
- The puzzle data is the Times’ own, and this page reports and explains the solution. EnergyPips is not affiliated with The New York Times, and the boards are not reproduced here to play — to play, go to the Times. To play a free daily domino puzzle of our own, the rest of this site is that.
- Why is the hard board harder than the easy one?
- On October 16, 2026 the hard board runs 28 squares across 17 regions against the easy board’s 10 and 5, and carries 7 regions that give you no exact number to work from.
About these answers
EnergyPips is an independent site and is not affiliated with, endorsed by, or connected to The New York Times. This page reports and explains the solution to a published puzzle, constructed by Ian Livengood (easy, medium), Rodolfo Kurchan (hard) and edited by Ian Livengood — the board itself is not reproduced here to play. To play it, go to the official NYT Pips puzzle. To play a free daily domino puzzle of our own making, with a full archive, start here.
Keep reading
- Printable pips puzzlesBoards laid out for paper, with a print sheet you can run off.
- NYT Pips hardEvery hard board measured: size, who builds them, the extremes, and how to beat one.
- Domino pipsThe tiles themselves: the 28-piece set, its 168 pips, doubles, and how a hand is scored.
- Pips hintsToday's three NYT boards, one graduated hint at a time — no solution unless you ask.
Or go back to today's pips puzzle.