To check whether a codeword answer is correct, compare its length, confirmed letters and repeated-letter pattern with the numbered entry. Then test every proposed number-to-letter assignment throughout the grid. A real dictionary word can still be the wrong answer if it breaks a mapping elsewhere.
This guide gives you a checking routine for a single candidate and a final audit for a completed puzzle. The worked examples are constructed demonstrations, so you can apply the same checks to any standard one-to-one codeword.
Five checks before you confirm an answer
| Check | Question to ask |
|---|---|
| Length | Does the exact spelling fill the available cells? |
| Known letters | Does every supplied or independently confirmed letter match? |
| Repeated numbers | Do equal numbers receive equal letters everywhere in the word? |
| Unique assignments | Does each different number receive a different letter? |
| Whole-grid consistency | Do the proposed mappings agree with the key and connected entries? |
After those structural checks, verify that the exact word form is allowed by the publisher. A dictionary can establish spelling and meaning, but the puzzle’s instructions may restrict which kinds of words are used. These five checks catch the common mistakes that can leave an error in the grid.
If you are new to the format, start with the basic routine for completing a grid. The checklist here is designed for the moment when you already have a possible answer.
Check the actual spelling and length
Write the full candidate under the cells, one letter per number. Do not rely on how the word sounds or how many letters you think it contains. Doubled letters and regional spellings can change the count.
COLOUR has six letters; COLOR has five. TRAVELLING and TRAVELING also differ in length. If your candidate does not fit the cells, do not remove a letter merely to force it into place.
Check the word’s boundaries too. A printed grid can make it easy to overlook a blocked cell or accidentally combine two entries. Establish the exact answer space before examining the letter relationships.
Our reference on spelling choices that affect the grid can help when two familiar forms have different lengths or letter positions.
Match every repeated number
Equal numbers must carry equal letters in the standard format. This applies to letters separated by several cells just as much as to adjacent doubles.
Consider the five-cell pattern 2 5 8 5 2. Positions one and five match; positions two and four match. LEVEL and REFER both have that structure, while LEVER does not.
LEVER begins with L and ends with R, so it would give two different letters to number 2. It may look almost identical to LEVEL, but the numbered relationship rules it out immediately.
Read the pattern cell by cell rather than relying on its overall appearance. See how repeated positions constrain an answer for more examples of distant repeats.
Check different numbers as carefully as matching ones
The reverse check matters too. In a standard one-to-one codeword, two different numbers cannot represent the same letter.
Suppose a five-cell entry has five different numbers. APPLE cannot fit because its two Ps would need different numbers. Matching the word’s length and some known letters does not repair that conflict.
This rule also applies outside the current entry. If the key already establishes 10 = P, a new candidate cannot assign P to number 7. Keep the alphabet visible so you can spot used-letter conflicts quickly.
A useful verification method is to read your key in both directions: each number has one letter, and each assigned letter has one number. Any duplication deserves investigation before you fill more cells.
A worked check using LEVEL
Return to the constructed pattern 2 5 8 5 2. Suppose 2 = L and 5 = E are supplied. The visible entry is LE?EL, and LEVEL is a plausible candidate.
- Length: LEVEL has five letters, matching the five cells.
- Supplied letters: positions one and five are L; positions two and four are E.
- Repeat structure: the repeated Ls and Es match the repeated numbers.
- New mapping: the candidate proposes 8 = V.
- Global key: check that V is not already assigned to another number.
Now inspect every other occurrence of number 8. Imagine another entry has numbers 2 5 11 8 5, with 11 = A independently confirmed. Substituting V gives LEAVE, which supports the proposal.
That is useful evidence, but keep its role clear. If you had also guessed 11 = A merely to make LEAVE, the second word would provide weaker support. Independent information is what makes the check more reliable.
Continue through the remaining 8s and confirm that the candidate fits the puzzle’s vocabulary. If all checks agree, you have a sound basis for accepting the answer.
A word that fits locally can still fail globally
Imagine LEVEL passes the visible-letter and repeat tests, but your key already has 17 = V. Under the one-to-one rule, number 8 cannot also become V. You must resolve that conflict.
First ask how 17 = V was established. If it was supplied, reject the new candidate. If it came from a tentative answer, review that earlier assumption rather than changing it silently.
This is why keeping tentative letters separate is useful. Without that distinction, two guesses can look like two competing facts, and you may erase the wrong part of the puzzle.
Record the reason for the conflict. A note such as “LEVEL requires 8 = V, but V is confirmed at 17” is precise enough to guide the next step. This is what happens when the solver finds nothing.
Use a dictionary for the exact candidate
Check the spelling you intend to enter, not just a related base word. A plural, past tense, variant spelling or specialised form may need its own verification.
Also check dictionary labels. A name, abbreviation, obsolete form or regional usage may not fit the publisher’s rules. Lovatts, for example, states a no-proper-nouns policy for its Code Cracker; do not assume every other publication has identical restrictions.
A search result containing a string is not equivalent to a dictionary entry. The string might be a name, typo or fragment. Use a reputable word reference and the relevant puzzle instructions.
Conversely, do not reject a word solely because you have not seen it before. The structural tests and accepted vocabulary decide whether it remains a candidate.
Check tool suggestions against the original grid
A tool may return words matching the constraints you entered. If you omitted repeated-number information or treated a guessed letter as fixed, the result may not reflect the actual puzzle. Remember the wildcard rules when a pattern includes blanks.
Before accepting a suggestion, compare its five checks with the original numbered cells. Use the grid-focused tool to review your entries if useful, following the page’s instructions rather than assuming a particular automatic checking feature.
Remember that an interface may fill every matching number without verifying the answer. Repetition of your input is convenient, but it is not independent confirmation that the letter is correct.
A final audit for a completed puzzle
When the grid looks finished, check it in a different order from the one you used to solve it. Read all across entries, then all down entries, and compare each with the same key.
Look for a single missed replacement, a copied number error or a letter written over a previous guess. These mechanical issues can survive even when your reasoning was sound. If you spot one, start by fixing a wrong letter before re-reading the grid.
If the instructions guarantee that every alphabet letter appears, check that requirement too. If they do not, do not force an unused letter into the grid. Finally, compare with the publisher’s official solution when available.
Frequently asked questions
Does a valid dictionary word prove the answer?
No. It must also satisfy the number pattern, supplied letters, global key and the publisher’s vocabulary rules.
What if two candidates still fit?
Keep both provisional. Investigate a number on which they differ, or wait for another entry to provide independent evidence.
Should I erase everything after finding one conflict?
No. Trace the conflict to its uncertain assumptions and review the dependent letters. Preserve supplied and independently established mappings.
Sources
- Lovatts: Code Cracker instructions and vocabulary policy.
- Puzzler: Codeword rules and answer construction.
- Codeword Solver: Repeated-letter rules and British versus American spelling patterns.



