Letter Boxed Solver

Stuck on a letter boxed puzzle? Enter the 12 letters on the four sides of the square and this solver finds the word chains that use every letter in the fewest words: all one- and two-word answers, or the shortest three-word chains when no pair works. It runs in your browser.

Your box

Type the three letters on each side of the square, in any order.

Enter three letters for each side, then press Solve.

How to use it

  1. Type the three letters of each side into its box. Order within a side does not matter.
  2. Press Solve. The first solve downloads the word list; later solves reuse it.
  3. Read the chains top to bottom: shortest total length first. Each arrow means the next word starts with the letter the last one ended on.

The rules

  • Words are at least 3 letters long and use only the 12 letters on the box. Letters can be reused.
  • Two letters next to each other in a word must come from different sides, so no double letters.
  • Each word starts with the last letter of the previous word.
  • The puzzle is solved when every letter has been used.

Worked example

Press Load example for the box GKI / AOP / TNL / YRE (top, right, bottom, left), then Solve.

No single word uses all 12 letters, but 16 pairs do. The shortest is PRATINGLY → YOKE, 13 letters. PRATINGLY is legal because every step changes side: P (right), R (left), A (right), T (bottom), I (top), N (bottom), G (top), L (bottom), Y (left). It covers everything except K, O and E, and YOKE starts on the Y it ended with and picks those three up. KIT would not be allowed, because K and I share the top side.

Some boxes have no two-word answer. For HPW / OAY / GNL / IEX no pair of words covers all 12 letters, so the solver explains that and lists 22 three-word chains, starting with HOWE → EPIGEAL → LYNX.

How the search works

The solver first filters the word list down to words that only use the box's letters and never stay on one side, usually a few hundred to a few thousand. Each word is stored as a 12-bit mask of the letters it covers, with its first and last letter.

A chain's progress is fully described by two things: the set of letters covered so far and the letter it ends on. That gives at most 4,096 × 12 states. The solver tries one-word chains, then two, three and four, and remembers for each state whether it can still be finished in the words left, so it never explores the same dead end twice. The first word count with an answer is the shortest possible solution; within it, chains are ranked by total letters. The search has a time limit so a slow device never freezes.

The word list is ENABLE (Enhanced North American Benchmark Lexicon), a public-domain list of 172,823 words.

FAQ

What are the rules of a letter boxed puzzle?
Twelve letters sit around a square, three on each side. Each word must be at least 3 letters long, and two letters next to each other in a word cannot come from the same side, so double letters are never allowed. Each word starts with the last letter of the word before it, and the puzzle is solved when every letter has been used at least once.
How does the solver find the shortest solution?
It first keeps only the dictionary words that obey the side rule. Each word becomes a 12-bit set of the letters it covers plus its first and last letter. The search then tries chains of one word, then two, then three and four, and for every state (letters covered so far, last letter) it remembers whether the remaining words can still finish the puzzle, so dead ends are skipped instead of searched again. All one- and two-word solutions are shown; if there are none, the chains with the fewest words are shown, shortest total length first.
What if a letter appears on two sides?
In this puzzle every letter appears exactly once, which is what makes the side rule well defined. If you type a letter twice, the solver tells you which sides it is on so you can fix the typo, rather than guessing which side a word should use.
Why is there no two-word solution?
Some letter sets have no pair of words that covers all 12 letters, often because a rare letter such as X or J only fits in short words. The solver then shows three-word chains, and four-word chains if needed. If no chain of up to four words exists in the word list, it says so.
Why does the solver accept words the game rejects?
The solver uses the public-domain ENABLE word list of 172,823 words, which includes rare and Scrabble-style words. A daily puzzle may use a smaller list, so try a few of the top solutions if the first is refused.
Is what I type sent anywhere?
No. The word list is downloaded once when you press Solve, and the search runs in your browser. The letters you type are not stored, logged or put in the URL.

Related

Letter Boxed is a trademark of The New York Times Company. Not affiliated with or endorsed by The New York Times Company.