A word unscrambler never shuffles your letters. That surprises most people, because shuffling is what a person does with tiles on a rack. The tool does something drier and much faster. It holds a word list, turns the letters you type into a set of counts, and tests every word in the list against those counts. Any word whose letters can be covered by your counts is a result. This page walks through the method on one real rack, the six letters of LISTEN, using the same list and the same test as the Word Unscrambler on this site.
The word list is the whole game
Every unscrambler is two things: a list and a test. The list decides which words can ever come back. If a word is not in the list, no cleverness in the test will find it, and if a junk word is in the list, it will dutifully show up in your results. This site's list is ENABLE, a public domain English word list of 172,823 words. It is stored as plain text files split by word length, one file for two-letter words, one for three-letter words, and so on. That split matters for speed, as the trace below shows.
Lists are also why two unscramblers disagree. There is no single official list of English words for games. Tournament Scrabble uses copyrighted lists (the NASPA Word List in North America, Collins Scrabble Words in most other places), puzzle apps use their own, and open tools mostly use ENABLE because it can be shared freely. The disagreements sit at the edges, in rare and recent words, and the limits section at the end of this page names the ones players notice most.
Step one: your letters become counts
Type LISTEN and the tool forgets the order at once. What it keeps is a count for each letter: E once, I once, L once, N once, S once, T once. A rack with a repeated letter keeps that too: type LETTERS and the count is E twice, T twice, L, R and S once each. Order is not lost information that the tool later regrets. For the question "can these tiles spell this word", order genuinely does not matter, and dropping it is what makes the test cheap.
Step two: why the tool does not shuffle
Consider the shuffling approach honestly. To find every word in a seven-letter rack by rearranging, the tool would have to generate every order of every subset of the letters and look each one up. Seven distinct letters make 5,040 orders at full length alone, and 13,692 arrangements across all lengths of two or more. That is still small. Ten letters make 3,628,800 full-length orders. Twelve letters make 479,001,600. The count test avoids the explosion completely. It never builds a single arrangement. It asks, of each word already in the list, one question: do your letters cover this word's letters? The list has a fixed size, so the work grows with the list, not with the wild number of ways letters can be arranged.
The trace: one rack through the machine
Here is the LISTEN rack, followed through the actual test. First, length. A six-letter rack can only spell words of six letters or fewer, so the tool loads the length files for two to six letters. (For a seven-letter rack it would load two to seven, which is 51,948 words in total.) Then every word meets the count test. Five real verdicts from the run:
| Word tested | Verdict | Why |
|---|---|---|
| SILENT | Passes, uses all six letters | Its counts are the rack's counts exactly |
| ISLET | Passes, uses five letters | Every letter it needs is in the rack, one L left over |
| LISTENS | Fails | It needs S twice. The rack holds S once |
| TENETS | Fails | It needs T twice and E twice. The rack holds one of each |
| STRIPE | Fails | It needs R and P. The rack holds neither |
Ninety words pass the test for LISTEN: six that use every letter, then 16 of five letters, 32 of four, 25 of three and 11 of two. The failures outnumber the passes by hundreds to one, and nearly all of them fail on the first letter whose count runs out, which is why the whole run finishes before you notice it started.
Where signatures come in
There is a second way to organise the same idea, and this site's Anagram Solver uses it. Sort a word's letters into alphabetical order and you get its signature. LISTEN, SILENT, ENLIST, TINSEL, INLETS and ELINTS all sort to EILNST, so one lookup by signature finds the whole family at once. Signatures are perfect when every letter must be used, which is the anagram question. The count test is the general form: it also allows a word to use fewer letters than the rack holds, which is the unscrambler question. Under the surface, both are the same refusal to shuffle.
Blank tiles are a deficit, not a letter
A blank tile has no letter, so it cannot be counted as one. The test handles it as a deficit budget. The word's counts are compared with the rack's, and any shortfall is charged against the number of blanks you entered. If the total shortfall is no more than the blanks, the word passes, and the letters the blanks covered score zero. The rack F, I, Z plus one blank finds FIZZ this way: the second Z is the shortfall, one blank pays for it, and the word scores 15, not 25, because a blank Z is worth nothing. Enter three blanks and the budget is three letters, which is why results grow so fast.
Sorting the pile
Finding the words is half the work. Presenting ninety of them usefully is the other half, and the order is a choice, not a fact. This site groups by length, longest first, because the longest word is usually the one worth playing. Inside a group, words are ordered by how often they appear in a large count of published English text, and the common ones carry a one-line meaning from Princeton WordNet. Alphabetical order would bury SILENT under ELINTS. Score order would be worse: it promotes any obscure word holding a Q or a Z over the everyday word you actually want. Frequency order keeps the playable, recognisable words where your eye lands first.
The limits, stated plainly
Four limits are worth knowing before you trust any unscrambler's output, this one included. First, the list is a snapshot. ENABLE predates some recent tournament additions, so QI and ZA are not in it, and a handful of other words differ from the list your game uses. Second, the list holds ordinary English words and no names, so a person or a place will never be a result. Third, the tool sees letters, not a board: the tile scores it shows leave out double and triple squares and the fifty-point bonus for using a full rack, because it cannot know where the word will land. Fourth, it finds single words only. Two-word answers and phrases are a different problem, and this test does not touch them.
None of that makes the tool weak. It makes it a known quantity. Within its list, the count test is exact: it cannot miss a word your letters can spell, and it cannot invent one they cannot. That is the whole method. When you are ready, the Word Unscrambler runs it on your own rack.
See the method work on your own letters.
Open the Word UnscramblerQuestions
Does a word unscrambler try every possible order of my letters?
No. Shuffling is the slow way, and it gets hopeless quickly: seven letters have 5,040 orders, and twelve letters have 479,001,600. The tool counts your letters instead and tests each word in its list against the counts, which is why a seven-letter rack can be checked against 51,948 words in well under a second.
Why do two word unscramblers give different results?
Because they hold different word lists. A tool is its list, and lists disagree at the edges: a few hundred words that one includes and another does not. This site uses the ENABLE list, which is public domain. Tournament Scrabble lists are copyrighted and differ from ENABLE in places, QI and ZA being the best known example.
Is using a word unscrambler cheating?
That depends on the game in front of you, and it is a question for the people playing, not for the tool. In organised tournament play, outside help during a game is against the rules. In a friendly game, agree before you start. Used between games, a solver is a study aid: most players who improve fast keep a note of the words it finds that they did not know.
What is the difference between an unscrambler and an anagram solver?
An unscrambler returns every word your letters can cover, including short ones that leave letters unused. An anagram solver is stricter: the word must use every letter exactly once. The Anagram Solver page on this site runs that stricter test, and it explains the signature method it uses.
Sources
- ENABLE word list (public domain), 172,823 words, the list this site's tools run on: github.com/brokensandals/wordlists. QI and ZA checked as absent from this file directly.
- Princeton WordNet, the source of the one-line meanings beside common results: wordnet.princeton.edu
- Word frequency counts from published English text (Google Books n-gram data), collected by Peter Norvig: norvig.com/ngrams/count_1w.txt
- All counts, verdicts and the worked trace on this page were computed from the files above on 28 October 2026. The full method is also described on How We Verify.
Update log
28 October 2026: published, with the LISTEN trace and all counts computed from the site's word list on the same day.