Letter Boxed helper
A Letter Boxed helper finds words that hop around a square of 12 letters. Consecutive letters cannot come from the same side. Words are 3+ letters. This page lists legal ENABLE words and a greedy chain. ENABLE is not the New York Times list — practise a square, do not paste today’s official answers.
Try WAX · EIT · LNR · ODG (type 12 letters clockwise from the top). Fill Top / Right / Bottom / Left, or paste all 12 in order. Related: Spelling Bee helper.
Use ? for a blank tile. Words appear as you type.
Words from your letters
Length
Green letters
Grey letters
Yellows go in Letters. Greens in the five boxes.
More options
Dictionary: ENABLE, loading words.
Recent racks
Daily habit
Wordle helper
Greens, yellows, greys. Open it every morning.
Board games
Scrabble finder
Scores and bingos for a seven-tile rack.
Learn
Two-letter words
The list that wins close games.
How the square works
Rivals rank for “letter boxed solver” and “letter boxed hints” with daily NYT answer pages. We do not publish today’s NYT answers. This is a solver: paste any 12 unique letters, 3 per side.
Rules used here: 12 unique letters; words 3 letters or longer; consecutive letters must sit on different sides; letters may be reused in later words. A solution is a chain where the last letter of one word is the first letter of the next, covering all 12 letters. The suggested chain is greedy, not always the shortest.
Not affiliated with The New York Times. Related: Spelling Bee helper, word generator (reuse, no sides) and crossword solver.
FAQ
Is this the New York Times Letter Boxed?
No. Not affiliated. Paste any square to practise. ENABLE is public-domain; NYT uses its own word list, so some ENABLE words will not count officially.
How do I enter the sides?
Type 12 letters clockwise from the top side (3+3+3+3), or fill the Top / Right / Bottom / Left boxes. Each side is three letters, all 12 unique.
What is a chain?
A sequence of legal words where each word starts with the last letter of the one before it, and together they use every letter on the square at least once. This page suggests one greedy chain; better chains may exist.