To solve a codeword with few starter letters, copy every supplied mapping into the grid, look for repeated-number patterns, and compare possible words across several entries. Your first aim is to establish one well-supported new letter. Trying to recognise an entire corner immediately usually creates more guesses than useful information.
A sparse start can feel unhelpful because many entries remain almost blank. Yet the numbers already show where letters repeat and which positions must differ. That structure remains available even before you know whether a particular number represents a vowel or a consonant.
This guide focuses on the opening stage: choosing an entry, recording alternatives and finding the next piece of evidence. If you need the full rules first, read How to Solve Codeword Puzzles.
What a small starting key actually tells you
In a standard one-to-one codeword, one number represents one letter throughout the puzzle. Different numbers represent different letters. If the supplied key says 4 = A, every square numbered 4 contains A, and another number cannot also represent A.
Two supplied letters therefore give you both positive and negative information. They fill certain squares, but they also remove those letters from the possibilities for every other number. Keep the complete key beside the grid so that this second benefit is not forgotten.
Check the publisher’s instructions before using extra assumptions. Some formats guarantee that all 26 letters occur; do not apply that condition to every miniature puzzle or teaching fragment. The number of supplied letters also varies, so a familiar-looking layout does not establish the rules by itself.
Prepare the grid before considering words
Enter each starter everywhere it appears. Work in a consistent direction, such as row by row, and then scan the grid again. A missed starter may hide the very entry that would have provided your opening.
Next, mark the entries containing those letters. You are not ranking them only by length. A seven-letter entry with a distinctive repetition can be more useful than a three-letter entry with no known positions.
Keep confirmed and tentative letters visibly separate. On paper, use the main key for confirmed assignments and a small note beside the grid for hypotheses. In an app, check whether entering a letter automatically spreads it to every matching number before testing a candidate.
Look for structure rather than your favourite word
A number sequence such as 8–3–8–5 has the pattern A–B–A–C. Positions one and three match, while the other positions differ from them and from each other. That requirement is stronger than knowing merely that the entry has four letters.
For example, EVEN follows A–B–A–C. EVER also follows it. EYES does not, because its first and third letters differ. You can make these checks without deciding which candidate belongs in a particular puzzle.
Adjacent repeated numbers are equally useful. They require a double letter, but do not tell you which double letter it is. Compare several possibilities instead of automatically writing LL or EE. The guide to using repeated numbers as evidence explains this relationship in more detail. For entries with no known letters, keep the pattern visible with wildcard symbols.
A worked opening with two starter letters
The following is an original teaching fragment, not a complete newspaper grid. Its initial key contains only 4 = A and 9 = E. Consider an entry numbered 7–4–7–9. After copying the starters, you see ?A?E, with matching first and third letters.
BABE and RARE both satisfy that shape. This is an illustrative shortlist, not a claim that every dictionary possibility has been listed. Crucially, familiar words such as GAME and NAME fail: their first and third letters are different.
| Candidate | Proposed mapping | Initial result |
|---|---|---|
| BABE | 7 = B | Fits this entry |
| RARE | 7 = R | Fits this entry |
| GAME | 7 would mean G and M | Reject |
| NAME | 7 would mean N and M | Reject |
Now find another occurrence of number 7. Suppose a second entry is 10–4–7. It currently reads ?A?. Testing the two candidates makes its ending either B or R. The first route permits words such as CAB; the second permits words such as CAR.
Nothing has been proved yet. Two plausible connected words do not establish a unique answer. Record both routes and move to a position that can distinguish them. This is a productive pause, because you know exactly which uncertain mapping matters. Before choosing between them, check which letters to try first.
Return when independent evidence arrives
Later, suppose another part of the puzzle independently establishes 11 = O and 12 = W. A separate entry numbered 4–7–7–11–12 now reads A??OW, with the two missing letters identical.
Within your recorded B/R alternatives, R produces ARROW and B produces ABBOW. ARROW is the viable ordinary-word candidate. That supports 7 = R, turning the original entry into RARE. Check any remaining alternatives against the puzzle’s dictionary rules before treating the mapping as settled.
Notice where the useful evidence came from. You did not choose R because RARE felt more familiar than BABE. You carried the uncertain number into another entry and tested the consequences against independently obtained letters.
Choose the next entry by what it can resolve
When several entries look promising, ask which one tests an existing uncertainty. An entry containing your B/R number and two confirmed letters may be more useful than a longer word with many unrelated blanks.
A practical order is to inspect repeated shapes, entries with several confirmed positions, and numbers shared by multiple partly filled entries. Treat this as a flexible workflow. The most frequent unresolved number is useful only when its surrounding entries provide something you can actually test. For worked shapes, see the codeword pattern examples.
You can use the Codeword Grid Solver alongside your notes. Keep the printed grid or original puzzle visible so that a transcription error in a digital copy does not become invisible.
Keep a short candidate record
For each uncertain entry, record its number sequence, known letters and two or three candidates worth testing. Add the reason a candidate survives or fails. “Fits length” is weaker than “also matches both occurrences of number 7”. Keep the record in a codeword solving worksheet.
A useful note might read: “7 = B or R; examine A77OW when its last two numbers are known.” That note gives your next action a purpose. A loose list of unrelated words does not.
When rejecting a candidate, preserve the reason briefly. If you later discover that one supposedly confirmed letter was only a guess, you can identify which rejections depended on it. This prevents an early mistake from permanently removing the correct route.
What to do when every entry still looks open
Recheck the starter transcription first. Then inspect repetition patterns without trying to read whole words. A previously overlooked double number or repeated first-and-last number may narrow an entry.
Next, reconsider whether you have treated a hypothesis as a fact. Remove that restriction from your notes and see which candidates return. The method for solving with evidence instead of committing guesses is especially useful at this stage.
If you use a dictionary or candidate tool, search with the smallest reliable set of constraints. Check every result against the number pattern and existing key. A word list supplies possibilities; it does not know that your unrecorded number 18 already represents its third letter. Before widening the constraints, check the pattern with the missing-letter tool.
Questions about sparse starts
Should I put E into the most common number?
You can test that idea, but it is not a deduction. A single constructed grid need not follow the letter distribution of ordinary prose. Mark E as tentative and check the entries affected before accepting it.
Can one solved word unlock the puzzle?
Sometimes it reveals several useful mappings. Its value depends on which numbers it contains and where they recur. A word that adds only one new letter may still be the best opening if that letter connects several difficult entries.
Is it wrong to leave two candidates unresolved?
No. Keeping alternatives is often the correct response to incomplete evidence. Return when a crossing or another occurrence of the same number can separate them. Reliable progress matters more than filling the greatest number of squares immediately.
Sources
- Puzzler: Codeword puzzle rules and solving guidance.
- Lovatts Puzzles: Code Cracker instructions.
- Codes Word Solver: How to Solve Codeword Puzzles.



