How to solve racks with repeated letters

STEP 01

Write counts instead of a loose list

If the rack is ONSETS, write S2 and every other letter as one copy. A candidate containing one S has not used the full rack; a candidate containing three is impossible. Alphabetical tallies are faster to compare than two scrambled strings.

This matters most when a repeated letter is common, such as E, S, L, or T. The eye tends to notice that the letter is present while missing how many times it is required.

STEP 02

Test together, then apart

Some duplicates form a visible double, as in LETTER or HAPPY. Others belong in different syllables or at opposite ends. Place the pair together once, then deliberately separate it. The contrast prevents a familiar double-letter pattern from becoming a trap.

When separated, put one copy near the beginning and the other near the end. This simple move is especially useful with S, which may mark both an opening cluster and a plural ending.

STEP 03

Use duplicates to predict morphology

A repeated consonant can signal a spelling change before -ED or -ING. A repeated S may indicate a plural while another S belongs to the root. Two Es may support an -ER ending only if the base does not need both copies already.

Do not assume the grammatical explanation is correct; use it to generate a candidate, then compare the full inventory. Morphology guides the search, while the tally provides the proof.

• Mark every letter with a count above one.
• Try the duplicate as a double-letter block.
• Separate the copies across the word.
• Recount the final candidate from scratch.

STEP 04

Add a wildcard carefully

A wildcard can supply an additional copy of a repeated letter, but only after you assign it. If a word requires three Es and the rack has two Es plus a blank, the blank's role is fixed. Write E3 beside the candidate so you do not reuse the wildcard elsewhere.

Repeated-letter racks reward discipline more than speed. One ten-second tally prevents a long search built on the wrong inventory.