Skip to content
Pips

NYT Pips Answers for June 23, 2026

NYT Pips answers for June 23, 2026, a Tuesday: 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 32-square hard one, a gap of 22 squares, with the hard board carrying 6 doubles against easy's 1 and 7 loose regions against 3. Constructed by Ian Livengood and Rodolfo Kurchan. Edited by Ian Livengood.

Sukie, Puzzle editor at EnergyPips

By Sukie · Puzzle editor

Easy — 10 squares, 5 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 1 sum region have to carry the whole board.

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.

50% of its regions are loose against a norm of 40%, 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 2, 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.

  • = 2 (the middle right column of 2) — the pips in this region must add up to exactly 2. 2 combinations of values would satisfy it in isolation.
  • < 4 (the top right single square) — the pips in this region must add up to less than 4. 4 combinations of values would satisfy it in isolation.
  • = (the top left 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 top centre 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.
  • 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 = 2 region — the middle right column of 2 — where the pips in this region must add up to exactly 2. Work there first because only 2 combinations of values can fill it.

Hint 2 — what your tray forces

The tray carries 1 double: 1-1. 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 = 2 region resolves to 0, 2. Which half of which domino supplies each is still yours to work out.

Full answer — easy board, June 23, 2026
How each region resolves.
RegionWhereValues
=the top left column of 31, 1, 1
no rulethe top centre single square5
< 4the top right single square3
=the middle centre row of 26, 6
= 2the middle right column of 22, 0
no rulethe bottom centre single square4

Every tile and the squares it covers

  • 6-1 → row 3 col 2 and row 3 col 1
  • 5-3 → row 1 col 2 and row 1 col 3
  • 6-2 → row 3 col 3 and row 4 col 3
  • 0-4 → row 5 col 3 and row 5 col 2
  • 1-1 → row 1 col 1 and row 2 col 1

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.

56% 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.

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.

  • = 11 (the middle centre row of 2) — the pips in this region must add up to exactly 11 — and exactly one combination of values satisfies it, so it is forced.
  • = 3 (the middle left row of 2) — the pips in this region must add up to exactly 3. 2 combinations of values would satisfy it in isolation.
  • < 6 (the middle centre single square) — the pips in this region must add up to less than 6. 6 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.
  • no rule (the top centre single square) — No rule. A single free square — useful as somewhere to park a value the constrained regions cannot take.
  • 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 right 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 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 = 11 region — the middle centre row of 2 — where the pips in this region must add up to exactly 11. 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 2 doubles: 0-0, 5-5. 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 = 11 region resolves to 5, 6. Which half of which domino supplies each is still yours to work out.

Full answer — medium board, June 23, 2026
How each region resolves.
RegionWhereValues
no rulethe top left single square6
no rulethe top centre single square6
no rulethe top right single square1
= 3the middle left row of 21, 2
=the middle centre row of 25, 5
=the middle right column of 30, 0, 0
< 6the middle centre single square4
= 11the middle centre row of 26, 5
no rulethe bottom centre single square3

Every tile and the squares it covers

  • 6-3 → row 3 col 3 and row 4 col 3
  • 0-0 → row 3 col 7 and row 4 col 7
  • 6-1 → row 1 col 1 and row 2 col 1
  • 0-1 → row 2 col 7 and row 1 col 7
  • 6-5 → row 1 col 5 and row 2 col 5
  • 4-2 → row 3 col 2 and row 2 col 2
  • 5-5 → row 2 col 4 and row 3 col 4

Rows and columns are counted from the top-left of the board, starting at 1.

Hard — 32 squares, 16 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 4 sum regions have to carry the whole board.

At 32 squares this is 21% larger than the average hard board, which runs 26.4. More squares means more placements to keep straight at once, and a mistake made early sits underneath more correct-looking work before you find it.

44% of its regions are loose against a norm of 29%, so this board is vaguer than usual — there is less exact arithmetic to anchor on and more reasoning by elimination.

The tray holds 6 doubles against a typical 3.11. Doubles are the most constrained tiles you can be dealt, so this board hands you more forced placements than usual — an advantage, if you look for them first.

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.

  • = 12 (the top centre row of 2) — the pips in this region must add up to exactly 12 — and exactly one combination of values satisfies it, so it is forced.
  • = 12 (the top centre row of 2) — the pips in this region must add up to exactly 12 — 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.
  • > 10 (the middle centre row of 2) — the pips in this region must add up to more than 10. 2 combinations of values would satisfy it in isolation.
  • = 6 (the top centre row of 2) — the pips in this region must add up to exactly 6. 4 combinations of values would satisfy it in isolation.
  • < 5 (the middle centre single square) — the pips in this region must add up to less than 5. 5 combinations of values would satisfy it in isolation.
  • = (the top left column of 2) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
  • = (the middle right column of 2) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
  • = (the middle left 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.
  • = (the middle right column of 4) — every pip value in this region must be the same. 7 combinations of values would satisfy it in isolation.
  • 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.
  • 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.
  • 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.
  • > 13 (the middle left 3-square block) — the pips in this region must add up to more than 13. 11 combinations of values would satisfy it in isolation.
Hint 1 — where to start

Start with the = 2 region — the bottom centre single square — where the pips in this region must add up to exactly 2. 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 6 doubles: 3-3, 0-0, 4-4, 5-5, 6-6, 1-1. A double is the only tile that fits wholly inside an all-equal region, and there are 5 here.

Hint 3 — the opening region's values

The = 2 region resolves to 2. Which half of which domino supplies each is still yours to work out.

Full answer — hard board, June 23, 2026
How each region resolves.
RegionWhereValues
=the top left column of 22, 2
= 12the top centre row of 26, 6
= 6the top centre row of 25, 1
= 12the top centre row of 26, 6
=the middle right column of 23, 3
=the middle left column of 34, 4, 4
> 10the middle centre row of 26, 6
no rulethe middle centre single square5
< 5the middle centre single square4
=the middle centre 4-square block0, 0, 0, 0
=the middle right column of 41, 1, 1, 1
> 13the middle left 3-square block5, 5, 5
no rulethe bottom centre single square3
no rulethe bottom centre single square3
no rulethe bottom centre single square3
= 2the bottom centre single square2

Every tile and the squares it covers

  • 3-3 → row 7 col 4 and row 7 col 5
  • 0-0 → row 5 col 4 and row 5 col 5
  • 6-3 → row 1 col 7 and row 2 col 7
  • 4-2 → row 3 col 1 and row 2 col 1
  • 5-3 → row 7 col 2 and row 7 col 3
  • 4-4 → row 4 col 1 and row 5 col 1
  • 5-5 → row 6 col 1 and row 7 col 1
  • 1-6 → row 1 col 5 and row 1 col 6
  • 0-5 → row 4 col 5 and row 3 col 5
  • 1-2 → row 7 col 7 and row 7 col 6
  • 6-6 → row 3 col 3 and row 3 col 4
  • 1-1 → row 5 col 7 and row 6 col 7
  • 0-4 → row 5 col 3 and row 4 col 3
  • 6-5 → row 1 col 3 and row 1 col 4
  • 3-1 → row 3 col 7 and row 4 col 7
  • 6-2 → row 1 col 2 and row 1 col 1

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 June 23, 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 4 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 June 23, 2026 the hard board runs 32 squares across 16 regions against the easy board’s 10 and 6, 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), Rodolfo Kurchan (medium, 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.

Or go back to today's pips puzzle.