Skip to content
Advanced Codeword Strategies

Can a Codeword Puzzle Have More Than One Solution?

Understand the difference between several local candidates and genuinely different complete codeword solutions, with a checked ambiguity example.

7 min read
Can a Codeword Puzzle Have More Than One Solution?

Multiple codeword solutions are possible if two different complete fills satisfy all the puzzle’s rules, supplied letters and word restrictions. However, finding two words that fit one unfinished entry does not establish that the whole puzzle is ambiguous. Other entries may eliminate one of them.

The distinction matters when you are stuck. Local uncertainty usually calls for more checking. A genuine alternative solution requires a complete, consistent demonstration under the same rules as the intended answer.

This guide explains how to tell the difference, how a shared number can resolve apparent ambiguity and what evidence to collect before concluding that a published puzzle has two answers.

Local candidates are not complete solutions

Suppose an entry reads CA?. CAR and CAT both fit those visible letters. That gives you two candidates for one position, but says nothing yet about whether R or T works everywhere the corresponding number appears.

One candidate might conflict with a confirmed mapping in another corner. It might create an invalid crossing word or assign a letter already used by a different number. These checks belong to the whole puzzle, not just the entry in front of you.

A complete solution must fill every required square and preserve one consistent number-to-letter key. It must also satisfy the publisher’s word rules and any extra conditions explicitly included in the instructions.

The article on Codeword Number Patterns Explained covers the structural relationships that every candidate must preserve.

A small example with two valid possibilities

Consider two linked teaching entries. They are a fragment, not a complete crossword-style grid. The supplied key is 1 = C, 2 = A and 4 = O.

EntryNumbersVisible lettersSupplied candidate bank
A1–2–3CA?CAR or CAT
B4–2–3OA?OAR or OAT

If 3 = R, the entries become CAR and OAR. If 3 = T, they become CAT and OAT. Both assignments preserve the supplied letters and the shared number.

For this deliberately restricted exercise, the candidate banks define the allowed answers. There are exactly two compatible combinations: CAR with OAR, or CAT with OAT. CAR with OAT fails because number 3 would need two different letters.

This is a precise demonstration of ambiguity within a stated model. It does not claim that an unrestricted English dictionary contains only those candidates or that a larger unseen grid remains ambiguous.

How another entry resolves the example

Now add a third entry numbered 3–5–6–7–3. Its allowed answer in this teaching exercise is RIVER. That requires 3 = R, 5 = I, 6 = V and 7 = E.

The repeated number 3 appears at both ends, matching the two Rs in RIVER. Once this condition is included, the T alternative no longer works. Entries A and B must become CAR and OAR. An elimination strategy can then remove one of the two candidates without disturbing the other.

If you instead imagine ordinary grid solving with I, V and E independently confirmed, the third entry would appear as ?IVE?. Within the R/T alternatives being tested, R gives RIVER while T gives TIVET. The additional context separates the recorded candidates.

The restricted exercise and the practical illustration make slightly different claims. The supplied word bank proves a unique result for that exercise. A normal dictionary-based puzzle still requires checking its complete set of rules and plausible words.

What a genuine second solution must preserve

Start with the givens. Every supplied letter must remain unchanged. If your alternative requires altering a starter, you have changed the puzzle rather than solved the original one differently.

Next, check the number key in both directions. Each number must have one letter, and no two different numbers may share a letter under the standard one-to-one rule. Then verify every entry and every crossing.

Finally, apply the publisher’s vocabulary conditions. A proper name or abbreviation cannot rescue an alternative if the instructions exclude it. A dictionary entry may still be outside the permitted answer set.

If the publisher guarantees all 26 letters, both complete solutions must meet that condition. Do not add the condition yourself when it is absent, and do not ignore it when it is explicitly required.

Why swapping two letters may create an alternative

Imagine two unresolved numbers that appear only in a small group of entries. If exchanging their letter assignments turns every affected entry into another permitted word, the rest of the grid may remain unchanged.

That possibility is one reason a completed-looking fill deserves a consistency check. The question is not whether one altered word is valid. Every occurrence of both numbers must survive the exchange. If the swap was wrong, fixing a wrong letter starts by removing only the assignments that depended on it.

Puzzler’s construction guidance explicitly discusses avoiding alternative solutions. That describes a quality objective for its puzzles; it does not provide a proof of uniqueness for a particular grid you have not checked.

Supplied letters can remove this kind of freedom by fixing one of the interchangeable mappings. A well-placed additional entry can also distinguish alternatives, as the RIVER entry did in the teaching example.

What does not prove ambiguity?

Two suggestions in a solver list do not prove two complete solutions. A tool may have checked only the local word pattern. It may not know your full key, crossings or publisher restrictions.

Likewise, one returned suggestion does not automatically prove uniqueness. The tool’s dictionary may omit a legitimate alternative, or your input may contain a tentative letter that wrongly excludes it.

A long period without progress is not proof either. You may have overlooked another occurrence of a number or carried forward an incorrect assumption. Review those possibilities before attributing the difficulty to the puzzle.

The method for keeping candidate checks separate from guesses helps make that review more reliable.

A practical way to investigate two candidates

Label the alternatives A and B. Write down every mapping each one changes, then trace those numbers through the whole grid. Record the resulting entries separately instead of mixing letters from the two branches. If the solver finds no matches, the branch may be impossible rather than merely unfinished.

Look first at positions where the alternatives differ. An entry containing several unchanged letters and one changed number is a useful test. If one branch produces a contradiction with a confirmed fact, record that reason and reject the branch.

If neither branch fails immediately, keep both open. Work on another connected entry that might distinguish them. Do not let the first branch you tried acquire the status of “confirmed” simply because you spent more time on it.

The Multi-Pattern Codeword Solver can help you examine related patterns, but follow its documented capabilities. Independently check any shared-key conditions that your input does not express.

How to make a useful report to a publisher

If you find two complete fills, preserve the puzzle’s publication name, date or identifier and its original givens. Record both number keys and all entries that change between the fills.

Explain why each changed word is allowed under the same dictionary rules. If a disputed spelling or abbreviation is central, say so explicitly rather than presenting it as an unquestioned ordinary word.

A concise comparison is stronger than a screenshot of one uncertain corner. The publisher needs enough information to reproduce both solutions and determine whether an overlooked instruction resolves the difference.

Questions about unique codeword solutions

Does a finished grid always have the intended answer?

Only if the entries, key, givens and rules all agree. A grid can look finished while containing a mapping conflict or an excluded word. Run the full check before comparing it with an answer key.

Can a puzzle have a unique fill but unused key letters?

In a format that does not require every letter or number to appear, unused assignments may remain undetermined without changing any filled square. Distinguish the visible grid solution from a hypothetical completion of an unused alphabet key.

What should I do with unresolved alternatives?

Keep them labelled, identify the numbers on which they differ and seek evidence elsewhere. Claim multiple complete solutions only after both alternatives survive every relevant rule.

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 →