Skip to content
Codeword Patterns & Logic

How Linked Number Patterns Reveal Words in Codeword Puzzles

Use shared codeword numbers to compare candidates across different entries, preserve repeated letters and avoid circular confirmation.

6 min read
How Linked Number Patterns Reveal Words in Codeword Puzzles

Linked number patterns reveal codeword words because the same number represents the same letter throughout the grid. When two entries share a number, their candidates must agree on its letter, even if the entries do not physically cross.

The numbers are labels, not a mathematical sequence. You do not add, multiply or look for the next number. Instead, compare the positions occupied by each label and work out which combination of words preserves one consistent letter key.

This guide focuses on links between entries. For the structure of individual words, begin with Codeword Number Patterns Explained.

What makes two patterns linked?

Suppose one entry contains number 12 in its first square and another contains 12 in its final square. Those two positions must hold the same letter. Solving either position therefore supplies information for the other.

This is how crossings reveal letters: an across and a down answer share one cell. Shared numbers extend the relationship beyond crossings because separate cells elsewhere can carry the same label.

Both relationships matter. A difficult entry may become clearer through a distant word containing its unresolved number, even when its immediate crossing words offer little help.

Preserve both matching and different numbers

Under the standard one-to-one rule, equal numbers require equal letters. Different numbers require different letters. Checking only the first requirement can allow candidates that reuse a letter under two labels.

For example, 4–9–9–6 has the structure A–B–B–C. BOOK fits that structure: the two Os correspond to the repeated 9. NOON does not, because its first and last letters match even though 4 and 6 differ.

This rule applies across words as well. If one entry establishes 4 = B, another number cannot also represent B. Keep a single key instead of maintaining separate assignments for each entry.

A worked example with two linked entries

Here is an original teaching fragment. The confirmed key is 2 = C, 5 = A, 8 = E, 11 = O, 14 = I and 17 = N. Number 9 remains unknown.

Entry Numbers Visible pattern
A 2–5–9–8 CA?E
B 2–11–14–9 COI?

For entry A, consider CAGE, CAKE, CANE and CAVE. These are pattern examples to try, not an exhaustive dictionary list. They propose G, K, N or V for number 9.

The CANE proposal immediately conflicts with the key because N already belongs to number 17. You can reject it without examining entry B. The other proposals must be tested wherever 9 occurs.

Entry B becomes COIG, COIK or COIV under the remaining examples. None provides the intended ordinary-word completion. That tells you the shortlist for A has not yet supplied a successful joint candidate; it does not prove the puzzle has no answer.

Broaden the shortlist without weakening the rules

Add CARE to the candidates for A. It proposes 9 = R, which turns B into COIR. COIR is the fibre obtained from coconut husks, so it is a genuine word worth verifying in the puzzle’s dictionary.

This is a useful reminder that an unfamiliar completion should be checked rather than automatically rejected. CARE and COIR share R exactly where the number pattern requires it, and neither introduces a duplicate assignment in the displayed key.

Now check the crossings and other occurrences of number 9. The pair is consistent with this fragment, but a complete puzzle may impose further restrictions. Treat it as supported joint evidence, not a proof that no other permitted dictionary combination exists.

Compare candidate pairs, not isolated favourites

A local word can look convincing while its proposed mapping fails elsewhere. The useful object of comparison is therefore a compatible pair or group of candidates.

Candidate for A Proposes Consequence for B Decision in this example
CANE 9 = N COIN Reject: N already belongs to 17
CAKE 9 = K COIK Reject under the intended word test
CARE 9 = R COIR Consistent; check remaining constraints

CANE and COIN look particularly tempting because both are familiar words. Their failure comes from the complete key, not from spelling. That is exactly why linked-word solving needs both local patterns and global assignments.

Choose the most informative shared number

If two entries share several unresolved numbers, begin with the one whose alternatives are easiest to test elsewhere. A number appearing in a nearly completed word may provide more immediate information than a very frequent number surrounded by blanks.

Write down the candidates and identify their differences. If two alternatives disagree only at one position, follow that position’s number through the grid. Rechecking the letters the candidates share will not distinguish them.

Once a letter is established, update every occurrence and scan again. A newly filled square may turn a previously unhelpful entry into the best next place to work.

Avoid circular confirmation

Suppose you choose CARE and insert R into another entry, which then looks plausible. That second word is a useful consistency check, but it may simply reflect the original assumption.

Independent evidence comes from letters or rules established without the trial. In the worked example, the confirmed C, O and I make the consequence COIR meaningful to examine. You still need to compare alternatives and check dictionary acceptance.

Ask, “Would this information remain if I removed my first guess?” If the answer is no, record it as a dependency. The guide to keeping trials separate from deductions explains this distinction.

Use a tool without losing the relationships

The Multi-Pattern Codeword Solver can help you investigate several entries. Follow the page’s documented syntax and check which constraints its current search mode actually enforces.

If you use a solver for missing letters to search CA?E and COI? separately, the question marks do not by themselves communicate that both positions belong to number 9. Compare the results manually and require their letters to agree.

Keep your original numbered sequences beside the search. Anonymous blanks can lose information about repeated positions, while guessed letters entered as fixed text can exclude the correct route.

Do not interpret result order as proof. A tool’s dictionary and your input determine the shortlist. The complete grid remains the final source of constraints.

What to do when no candidate pair works

First check transcription, length and starter placement. Then inspect whether a fixed letter in either pattern came from a tentative guess. One incorrect restriction can eliminate every valid pair.

Next, review dictionary coverage. A smaller word list may omit a legitimate answer, as an unfamiliar word can be missed in a mental shortlist. Verify unfamiliar candidates rather than inventing spellings to rescue them.

Finally, revisit the complete key. Two valid words may still fail because they give one number different letters or reuse one letter under different numbers. The article on checking repeated-number assignments provides a useful refresher.

A repeatable linked-pattern routine

  1. Copy the exact sequences and all confirmed letters.
  2. Mark the numbers shared by the entries.
  3. Generate candidates without treating the first familiar word as certain.
  4. Reject conflicts with the existing key.
  5. Compare the letters proposed for every shared number.
  6. Verify spelling and any unfamiliar vocabulary.
  7. Check the remaining grid before confirming new mappings.

Keep unresolved alternatives when the evidence does not separate them. Linked patterns help because information can travel between entries; they do not guarantee that every pair of words resolves immediately.

The next useful step is usually another occurrence of the disputed number, a clearer crossing or a corrected assumption. Follow that evidence and let the shared key keep your candidate choices consistent.

Sources

About the author

Codeword Solver Team

The Codeword Solver Team builds and maintains Codeword Solver UK, a free codeword, code cracker and coded crossword solver for British puzzles. We write the solving guides published on this site and test every tool against UK dictionary word lists and real newspaper style codeword patterns.

View this author's guides →

← Back to all guides

Ready for your next codeword?

Put the patterns and strategies into practice.

Try the Codeword Solver →