A codeword solving worksheet helps you keep confirmed mappings separate from candidate words and temporary guesses. Use the number key for letters you have established, the candidate log for ideas you are testing and the evidence column to record why a mapping should be accepted or rejected.
The printable tables below provide a reusable working layout. They do not solve the puzzle for you; they preserve the information you need to make the next decision without repeatedly reconstructing your reasoning.
You can copy these tables into a document or print the relevant section from your browser. Check the print preview first, because page breaks and menus depend on the browser and website layout. Leave enough room to write clearly beside each candidate.
When a worksheet is useful
A small easy puzzle may need only a tidy key. A worksheet becomes more useful when several entries have competing candidates, a trial assignment affects many squares or you return to a puzzle after a break.
The important distinction is between what you know and what you are exploring. If both appear in the same unlabelled key, a plausible guess can quietly become the supposed evidence for later answers.
Keep the original puzzle beside your notes. A worksheet supplements the grid; it should not become an unchecked transcription that hides a copied number or a missed starter letter.
Printable number key
Write only confirmed assignments in this table. You can mark supplied letters with a small G beside the letter if you want to distinguish givens from later deductions. Different numbers must not share a letter under the standard one-to-one codeword rule.
| Number | Confirmed letter | Number | Confirmed letter |
|---|---|---|---|
| 1 | ________ | 14 | ________ |
| 2 | ________ | 15 | ________ |
| 3 | ________ | 16 | ________ |
| 4 | ________ | 17 | ________ |
| 5 | ________ | 18 | ________ |
| 6 | ________ | 19 | ________ |
| 7 | ________ | 20 | ________ |
| 8 | ________ | 21 | ________ |
| 9 | ________ | 22 | ________ |
| 10 | ________ | 23 | ________ |
| 11 | ________ | 24 | ________ |
| 12 | ________ | 25 | ________ |
| 13 | ________ | 26 | ________ |
Used-letter checklist: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z.
Cross off a letter only when its assignment is confirmed. The checklist helps identify accidental duplicate assignments; it does not mean that every puzzle necessarily uses all 26 letters. Apply an all-letters condition only when the publisher states it.
Printable candidate and evidence log
Give each entry a reference you can find again, such as 7 Across or row 3, column 2. Copy the exact number sequence before adding a letter pattern. That preserves relationships between unresolved positions.
| Entry | Numbers or pattern | Candidate and mappings | Evidence or next check | Status |
|---|---|---|---|---|
| ________ | ________ | ________ | ________________ | ________ |
| ________ | ________ | ________ | ________________ | ________ |
| ________ | ________ | ________ | ________________ | ________ |
| ________ | ________ | ________ | ________________ | ________ |
| ________ | ________ | ________ | ________________ | ________ |
Use simple status labels: tentative, rejected or confirmed. A question mark beside an unexplained word is less useful because it does not tell you what remains uncertain.
In the evidence column, prefer a concrete note such as “number 9 also appears at the start of ?ROG” over “looks right”. The first note identifies a test. The second records only an impression.
A filled example: SAFE or SAME?
Consider an original teaching entry numbered 2–4–9–6. The confirmed key gives 2 = S, 4 = A and 6 = E. You therefore see SA?E. This is a small example of how number patterns work.
SAFE and SAME are two candidates worth comparing. This is an illustrative shortlist, not an exhaustive list of English words matching the pattern. Other candidates must also be considered in an unrestricted puzzle.
| Candidate | Proposed mapping | Evidence | Status |
|---|---|---|---|
| SAFE | 9 = F | Fits the entry’s length and known positions | Tentative |
| SAME | 9 = M | Fits the entry’s length and known positions | Tentative |
Now suppose a different entry is numbered 9–10–11–12, and independent deductions establish 10 = R, 11 = O and 12 = G. It reads ?ROG.
The F proposal produces FROG. The M proposal produces MROG, which fails the intended ordinary-word test. This separates the two recorded candidates. Check any remaining alternatives, the complete key and every occurrence of number 9 before confirming F.
The word “independent” matters. If R, O and G came only from assumptions made while testing SAFE, the second entry is not separate evidence for the original guess. Record that dependency instead of counting it twice.
What to put in each column
Entry and original numbers
Use a reference that survives changes to your guesses. The number sequence remains stable even when a candidate word changes. For an unclued grid, a row-and-column location is enough if you use it consistently.
Candidate and proposed mappings
Write the complete word and the new assignments it would require. If it introduces three letters, record all three. That helps you detect a conflict before spreading the candidate through the grid.
Evidence and next check
State what currently supports the candidate and what could distinguish it from alternatives. Separate structural evidence, such as matching repeated numbers, from a general hunch about familiar vocabulary.
Status
Keep a candidate tentative until its evidence justifies commitment. If you reject it, keep a short reason. A later correction to an earlier mapping may make that rejected candidate worth reconsidering.
Use a rollback record for trial assignments
A trial can affect several words, so undoing only its first letter may leave unsupported consequences behind. Record which later assignments depend on the trial before the notes become difficult to untangle. Check the crossing words before accepting a trial assignment.
| Trial mapping | Dependent assignments | Reason removed or next action |
|---|---|---|
| ________ | ________________ | ________________________ |
| ________ | ________________ | ________________________ |
| ________ | ________________ | ________________________ |
When a contradiction appears, return to the most recent unsupported assumption involved. Remove its dependent guesses while preserving independently established letters. This is more controlled than erasing a whole region simply because its words now look awkward. If a trial fails, you will need to recover from a wrong letter without losing the assignments that still hold.
The guide to checking codeword ideas before committing them explains how to keep this process deliberate.
Combine paper notes with a solver
The Codeword Grid Solver can sit alongside your worksheet when you want help exploring an entry. Copy reliable information carefully and keep the original puzzle visible. If you are still building the habit, start with codeword practice for beginners before relying on a solver.
Record any tool suggestion as a candidate until you have checked the complete key. The tool may not know restrictions you have not entered, including a letter already assigned to another number elsewhere.
If you change a trial mapping in the tool, update the worksheet’s status and dependencies too. Two conflicting working copies can make a simple correction look like a new puzzle problem.
Keep the worksheet compact
You do not need to list every imaginable word. Record candidates that fit the current evidence and a next check that could separate them. If a list becomes long, seek another confirmed letter or a more informative linked entry.
Likewise, avoid copying the entire grid into the evidence log. Its purpose is to retain uncertainty and reasoning, not to duplicate the puzzle. The number key should remain quick to scan.
For a refresher on the underlying rules, return to How to Solve Codeword Puzzles before adding more elaborate notes.
Final checklist before calling the puzzle complete
- Every entry has the correct length and an allowed spelling.
- Each number represents one letter throughout the grid.
- Different numbers have different letters under the standard rules.
- Every supplied letter and crossing agrees with the final key.
- No tentative mapping remains disguised as a confirmed assignment.
- Any all-26-letters requirement comes from the actual puzzle instructions.
Finish by reviewing your rejected candidates and identifying the evidence that ruled them out. That brief review turns a completed puzzle into useful practice for the next one.
Sources
- Puzzler: Codeword rules and solving guidance.
- Lovatts Puzzles: Code Cracker instructions.
- Codes Word Solver: General solving and grid-solver guidance.



