Introduction
The NYT Spelling Bee puzzle launched in print in 2014 and moved to the NYT Games app in 2018, where it now attracts millions of daily solvers. The rules are simple: form words using 7 letters, where one center letter is mandatory. Words must be at least 4 letters long. A pangram uses all 7 letters. If you have ever stared at a honeycomb grid wondering if a word exists, this solver does the checking for you. Paste your 7 letters, set the center letter, and get every valid word instantly. No data leaves your browser.
What this tool does
- Finds all valid English words (4+ letters) from the 7 puzzle letters
- Identifies pangrams that use all 7 letters at least once
- Requires the center letter to appear in every word
- Sorts results by word length so longer, higher-scoring words appear first
- Runs entirely client-side using a built-in word list of common English words
How this tool works
The solver loads a word list from the server on page load. When you enter the 7 puzzle letters and specify the center letter, it filters the word list against two constraints: every character in the word must be one of the 7 allowed letters, and the center letter must appear at least once. Words shorter than 4 characters are excluded. The solver then checks each remaining word for pangram status by verifying that all 7 letters appear at least once. Results are sorted by length descending, which matches the NYT scoring system where longer words earn more points. The word list contains several thousand common English words, which covers the vast majority of accepted answers. Obscure words that the NYT puzzle sometimes accepts may not appear if they are not in the list.
How the Spelling Bee puzzle works
The NYT Spelling Bee uses 7 unique letters arranged in a honeycomb. The center letter is required in every word. You can reuse letters as many times as needed. The scoring system awards 1 point for a 4-letter word and 1 additional point per letter for longer words. A pangram (using all 7 letters) earns a bonus 7 points. The puzzle was created by Frank Longo and is edited by Sam Ezersky. The maximum possible score varies per puzzle, and reaching it earns the title "Queen Bee." The solver implements a straightforward filtering approach: iterate through a word list, check letter membership against the allowed set, and verify the center letter constraint. This is an O(n * m) operation where n is the word list size and m is the average word length, which completes in milliseconds for typical word lists of 50,000+ entries.
How to use this tool
- Type all 7 unique letters from the puzzle into the input box (order does not matter).
- Enter the center (required) letter in the dedicated field above.
- The solver runs automatically and displays all valid words sorted by length.
- Pangrams are listed separately at the top of the results.
- Scroll through the list to find words you missed in the puzzle.
Real-world examples
Daily puzzle solving
You have letters A, C, E, L, P, R, T with center letter T. Enter "ACELPRT" in the input and "T" as the center. The solver returns words like "CARPET", "PALATE", "PLACATE", and the pangram "CARPET" if all 7 letters are used. This saves time when you are stuck at "Genius" level and want to reach "Queen Bee."
Verifying pangram candidates
If you suspect a word might be a pangram but are not sure, enter the letters and check the pangram section. For example, with letters B, E, I, L, N, O, W and center B, the solver confirms "BOWLINE" as a pangram since it contains all 7 letters.
Finding words you missed
After completing a puzzle at 70% of the maximum score, paste the letters to see which words you overlooked. The solver often reveals 5-10 words that are valid but easy to miss, such as obscure plurals or compound words like "TRACE" and "PLATE" that you simply did not think of.
Comparison with similar methods
| Method | Complexity | Typical use |
|---|---|---|
| This solver | O(n*m) filter | Browser-based, instant results |
| Manual solving | Human vocabulary recall | The actual puzzle experience |
| Anagram solvers | O(n!) permutation | Less efficient for 7-letter sets |
Limitations or considerations
The word list is not identical to the NYT accepted word list. The NYT uses a proprietary dictionary that includes some obscure terms and excludes some common ones. You may see words that the NYT does not accept, and the NYT may accept words not in this list. The solver is a helper tool, not a definitive answer key. Profanity and slurs are excluded from the word list, matching NYT editorial policy.
Frequently asked questions
Why does the solver find words that the NYT Spelling Bee does not accept?
The NYT uses a custom dictionary curated by the puzzle editor. It excludes some valid English words and includes some obscure ones. This solver uses a general English word list, so there will be occasional mismatches.
How is the NYT Spelling Bee scored?
Four-letter words earn 1 point. Longer words earn 1 point per letter. A pangram (using all 7 letters) earns a bonus 7 points on top of the per-letter score. The solver sorts by length to help you prioritize high-scoring words.
Can I use this for the NYT Mini Spelling Bee?
The Mini version uses the same rules with fewer letters. Enter whatever letters are available and the solver will find matching words.
Does the solver work offline?
The word list is fetched once on page load. After that, all solving happens in your browser. You need an internet connection only for the initial load.
Conclusion
The Spelling Bee solver is a practical tool for players who want to maximize their score or verify they have found every word. It runs in your browser with no server processing. Use it alongside the puzzle to discover words you might have overlooked, and remember that the NYT dictionary may differ slightly from this word list.