How word unscramblers work

A word unscrambler generates all permutations of the input letters and checks each against a dictionary. For a 7-letter word, there are 7! = 5,040 possible permutations - easy for a computer but laborious by hand. Efficient implementations use sorted letter signatures (anakeys) as dictionary keys so lookup is O(1).

Anagram theory

An anagram rearranges all letters of a word or phrase to form a different one. Famous anagrams: "listen" -> "silent", "astronomer" -> "moon starer", "conversation" -> "voices rant on".

Game applications

Scrabble/Words With Friends: best plays often require recognizing valid high-value anagrams.
Wordle: uses a set of common 5-letter English words.
Crossword solving: anagram indicators in cryptic crosswords (words like "mixed", "arranged", "confused").

Dictionary selection

Two main word lists are used in competitive Scrabble:

TWL (Tournament Word List): the official list for North American Scrabble tournaments.
Collins/SOWPODS: the list used in international and British tournaments; it includes all TWL words plus many more.

A word valid in one list may not be in the other. For example, “za” (pizza) is valid in both; some short words accepted in Collins are not in TWL.

Blank tile handling

In Scrabble, a blank tile can represent any letter but scores zero points. When unscrambling letters that include a blank, use a ? placeholder. The algorithm generates candidate words by substituting each of the 26 letters for the blank and searching the dictionary for each combination.

High-value word patterns

2-letter words: learning all valid 2-letter words (AA, AE, AI, OI, QI, etc.) is essential for competitive Scrabble - they enable parallel plays and hook connections.
Short J/Q/X/Z words: QI (10 pts), ZA (11 pts), JO (9 pts), XI (9 pts), XU (9 pts) - high-value short words that fit in tight board positions.
Hook words: words where adding a single letter to the front or back creates a new valid word.