What is the nonogram line overlap formula?

For a single clue N in a line of width W, the count of guaranteed overlapping cells is O = N - (W - N), which simplifies to O = 2N - W. If a line is 10 squares wide and the clue is 8, the overlap is 2(8) - 10 = 6 squares. These 6 squares sit symmetrically in the center of the line (from index 3 to index 8).

How does the multi-block overlap calculation work?

First, calculate the minimum span of all clues on the line: add the lengths of all numbers together plus one empty square for each gap between them. Next, calculate the slack: Line Width minus Minimum Span. Any clue whose length is greater than the slack has guaranteed overlapping cells equal to (Clue Length - Slack).

What is edge anchoring in nonograms?

Edge anchoring occurs when an ink square touches the outer perimeter or an established X border. Because the outermost clue must account for this square, you can extend the block inward to its full length and place a mandatory X immediately after the final square to seal the run.

Why is placing X marks just as important as filling ink?

X marks reduce the effective width of the remaining line. An X acts like a new wall, allowing you to recalculate smaller sub-line spans and discover new forced overlaps. X marks also prevent distinct clue blocks from accidentally merging together.

Can all valid nonograms be solved without guessing?

Yes. Every properly constructed nonogram puzzle (including all 15 plates on Play in Phone) has a single unique solution that can be proven 100% through deductive logic. Guessing introduces invisible branching errors that corrupt downstream deductions.

What should I do if I get stuck on a nonogram?

When stuck, scan perpendicular lines for newly placed ink or X marks. Recalculate line slacks using new X boundaries, look for gaps smaller than the smallest remaining clue, and check edge clues for reach limits.

Nonogram Solving Techniques: Overlaps, Edge Anchoring & Pure Logic

Nonograms (also known as Picross, Paint by Numbers, Griddlers, or Picture Cross) are deterministic constraint-satisfaction puzzles. Every row and column clue specifies the exact lengths and sequence of unbroken ink blocks. The challenge is not visual guessing—it is mathematical deduction.

On every properly authored nonogram board, every single cell can be proven to be either INK or an X using zero guesswork. When you master mathematical line overlaps, composite range bounds, and edge anchoring, even complex 10×10 and 15×15 grids resolve cleanly without backtracking.

The Golden Rule of Picross: Never guess a square. A single mistaken ink placement will silently satisfy one row while corrupting up to ten intersecting columns downstream. Pure deduction always yields the correct solution.

1. The Fundamental Overlap Formula: Single Large Clues

The single most powerful tool in nonogram solving is the Line Overlap Formula. Whenever a single clue $N$ is greater than half the total width of the line ($W$), certain central squares are guaranteed to be filled with ink, regardless of whether the block sits all the way to the left, all the way to the right, or anywhere in between.

The Single-Clue Overlap Formula

Overlap Count (O) = N - (W - N) = 2N - W

Where N is the clue number and W is the total width (or height) of the line.

To understand why this formula works, compare the two most extreme placements of the clue:

Left-packed placement: Push the block all the way to the starting edge (cells $1$ through $N$).
Right-packed placement: Push the block all the way to the ending edge (cells $W - N + 1$ through $W$).
The intersection: The cells shared by both extreme positions must contain ink in the final puzzle.

Worked Example: Clue 8 in a 10-Wide Row

Let row width $W = 10$ and clue $N = 8$. Using the formula:

O = 2(8) - 10 = 16 - 10 = 6 squares of guaranteed overlap.

Clue [8] on 10-wide line: Left-packed: [ ■ ■ ■ ■ ■ ■ ■ ■ · · ] (Cells 1–8) Right-packed: [ · · ■ ■ ■ ■ ■ ■ ■ ■ ] (Cells 3–10) ───────────────────────────────────────────── Forced Result: [ · · ■ ■ ■ ■ ■ ■ · · ] (Cells 3–8 ARE INK!)

Cells 3, 4, 5, 6, 7, and 8 are guaranteed ink before you even look at intersecting columns. You have immediately locked in 60% of the entire row.

Single-Clue Overlap Reference Table

Grid Width (W)	Clue Size (N)	Formula (2N - W)	Guaranteed Overlap (O)	Forced Cell Positions
5	3	2(3) - 5	1 square	Cell 3
5	4	2(4) - 5	3 squares	Cells 2, 3, 4
5	5	2(5) - 5	5 squares	Cells 1, 2, 3, 4, 5 (Full Line)
10	6	2(6) - 10	2 squares	Cells 5, 6
10	7	2(7) - 10	4 squares	Cells 4, 5, 6, 7
10	8	2(8) - 10	6 squares	Cells 3, 4, 5, 6, 7, 8
10	9	2(9) - 10	8 squares	Cells 2 through 9
10	10	2(10) - 10	10 squares	All cells 1 through 10

2. Multi-Block Range Bounds (Composite Overlaps & Slack)

Lines with multiple clues (such as 4 3 or 2 2 2) also have mathematically forced overlaps. You do this by calculating the line's Minimum Span and its Slack.

The Multi-Block Span & Slack Formulas

Minimum Span = ∑(All Clues) + (Number of Clues - 1) Slack (Freedom of Movement) = Width - Minimum Span

For any clue C on that line:

Overlap of Clue C = C - Slack (if C > Slack)

The Slack represents how many empty spaces the blocks can slide left and right. If a clue's length is greater than the total slack on that line, that specific clue is guaranteed to overlap itself!

Worked Example: Clues [4, 3] on a 10-Wide Line

Calculate Minimum Span: Clue 4 + 1 gap space + Clue 3 = $4 + 1 + 3 = 8$ squares.
Calculate Slack: Line width 10 minus span 8 = $10 - 8 = 2$ squares of slack.
Evaluate Clue 4: Length 4 is greater than Slack 2. Overlap = $4 - 2 = 2$ squares.
Evaluate Clue 3: Length 3 is greater than Slack 2. Overlap = $3 - 2 = 1$ square.

Clues [4, 3] on 10-wide line (Span: 8, Slack: 2): Left-packed: [ ■ ■ ■ ■ · ■ ■ ■ · · ] (4 at 1–4, gap at 5, 3 at 6–8) Right-packed: [ · · ■ ■ ■ ■ · ■ ■ ■ ] (4 at 3–6, gap at 7, 3 at 8–10) ───────────────────────────────────────────── Forced Result: [ · · ■ ■ · · · ■ · · ] (Cells 3, 4 are ink; Cell 8 is ink!)

Without checking a single vertical column, the mathematics of multi-block range bounding places three confirmed ink cells on the board.

Zero-Slack Lines (Full Span Lines)

When the Minimum Span equals the Grid Width ($\text{Slack} = 0$), there is zero freedom of movement. The entire line is completely solved in a single step:

Example: Clues [3, 1, 4] on a 10-wide row. Minimum Span = $3 + 1 + 1 + 1 + 4 = 10$.
Result: Fill 3 ink, mark 1 X, fill 1 ink, mark 1 X, fill 4 ink: [■ ■ ■ ✕ ■ ✕ ■ ■ ■ ■].

3. Edge Anchoring & Corner Extensions

Once you fill a few squares from overlap formulas, you look to the perimeter. Edge Anchoring happens whenever a clue touches or is bounded by an outer edge of the grid (or an existing X mark).

The Edge Anchor Rule: If an ink square sits at the edge of the board (index 1), the first clue on that line must start from that edge. It extends inward to its full length, and the square immediately following it must be an X.

Example: Edge Clue of 4 with Filled Edge Square

Suppose the clue list starts with 4 and cell 1 is confirmed ink:

Clue [4, ...]: Before: [ ■ ? ? ? ? ? ? ? ? ? ] (Cell 1 is known ink) Deduction: The 4 MUST cover cells 1, 2, 3, and 4. Cell 5 MUST be an X. After: [ ■ ■ ■ ■ ✕ ? ? ? ? ? ]

Offset Edge Reach Limit

What if cell 1 is an X, and cell 2 is ink with a first clue of 3? The block cannot start at cell 1, so it must occupy cells 2, 3, and 4. Cell 5 is immediately sealed with an X:

Clue [3, ...]: Before: [ ✕ ■ ? ? ? ? ? ? ? ? ] After: [ ✕ ■ ■ ■ ✕ ? ? ? ? ? ]

Corner Propagation Chain Reaction

When a corner square (1, 1) is filled with ink, it simultaneously anchors both Row 1 and Column 1. For instance, if Row 1 has clue 5 and Column 1 has clue 3:

Row 1 immediately fills cells (1,1) through (1,5) and stamps an X on (1,6).
Column 1 immediately fills cells (1,1) through (3,1) and stamps an X on (4,1).
Those newly placed ink cells now act as edge anchors for Rows 2 and 3, cascading across the entire board.

4. Punctuation & X-Marking Discipline

Novice players focus almost exclusively on finding ink. Expert players know that placing X marks is what actually solves nonograms. An X cuts a line into smaller sub-segments, drastically reducing effective line width and unlocking new overlaps.

The Punctuation Principle: When a block is completed to its required number, immediately seal both ends with an X. If a clue 3 is complete, leaving its ends blank invites accidental extensions or confusion with subsequent clues.

Technique 4A: Trapped Sub-Length Gap Elimination

If a gap between two X marks (or an edge and an X) is smaller than the minimum remaining clue for that segment, no block can physically fit inside that space. You can instantly fill the entire gap with X marks.

Clues remaining: [3, 4] Current row: [ ? ? ✕ ? ? ? ? ? ? ? ] Analysis: Cells 1–2 form an isolated 2-square gap. The smallest clue on this line is 3. Deduction: A 3 cannot fit in a 2-square space. Mark cells 1 and 2 with X! Result: [ ✕ ✕ ✕ ? ? ? ? ? ? ? ]

Technique 4B: Contradiction Spacing (Illegal Merging)

If you have two separate ink blocks on a line with clues [2, 2], and a single blank cell sits between them, ask: What happens if that blank cell is filled with ink?

Filling the gap would connect the two 2-blocks into a single continuous block of 5.
Because the clue list has no 5 (only two 2s), connecting them is mathematically illegal.
Therefore, the separating space must be an X.

5. Advanced Logic: Sub-Segment Projections & Squeezes

Sub-Segment Overlap Recalculation

When an X is placed in the middle of a line, treat the open spaces as independent sub-grids. If a 10-wide row has an X at cell 4, the right-hand side is a fresh 6-cell sub-grid (cells 5 through 10). If the second clue is 5, it cannot fit on the left (3 spaces), so it must live entirely on the right:

Sub-Width = 6, Clue = 5 → Overlap = 2(5) - 6 = 4 forced ink cells (cells 6, 7, 8, 9)!

The Squeeze (Reach Bounds)

When an ink cell is already placed, calculate how far that block can possibly reach in either direction:

Clue [3] on 10-wide row, with cell 6 filled: Current row: [ ? ? ? ? ? ■ ? ? ? ? ] (Cell 6 is ink) Maximum left reach: Block covers cells 4, 5, 6. (Cannot reach cells 1, 2, 3!) Maximum right reach: Block covers cells 6, 7, 8. (Cannot reach cells 9, 10!) Deduction: Cells 1, 2, 3 and cells 9, 10 can NEVER be part of this 3-block. Result: [ ✕ ✕ ✕ ? ? ■ ? ? ✕ ✕ ]

Placing those five X marks eliminates 50% of the unknown spaces in a single deduction.

6. Why Guessing Ruins Picross & How Pure Logic Wins

When beginners get stuck, their instinct is to pick a cell and "try" filling it to see what happens. This is the single biggest mistake in nonogram puzzles for three reasons:

Silent Cascades: A wrong guess often does not produce an immediate error. It will seem valid for 5 or 6 turns, spreading bad data across the entire board before creating an impossible clash.
Exponential Backtracking: Once you discover a contradiction after guessing, you cannot simply undo the last move; you have to erase every cell placed since the guess.
Uniqueness Guarantee: Every authored puzzle (such as the 15 handcrafted plates in Plates) has exactly one mathematically unique solution. If you cannot find the next move, a logical deduction is waiting to be found.

The 4-Step "Unstuck" Checklist

Whenever you hit a wall, run through this mental checklist before making any move:

Step 1: Scan for unpunctuated completed blocks. Look for any line where a block matches its clue length and make sure both ends are stamped with X.
Step 2: Check for sub-length gaps. Search for open spans between X marks that are shorter than the smallest remaining clue. Stamp them with X.
Step 3: Recalculate slacks in partitioned lines. Use new X marks as temporary walls to calculate overlaps in sub-segments.
Step 4: Cross-reference edge ink with perpendicular clues. Follow every ink cell touching a border into its intersecting row or column to apply edge anchoring.

Play Free Nonogram Puzzles (Plates)