gizmobench

Word Chain Puzzle Solver

Enter the three letters on each side of a four-sided letter box puzzle and this solver lists the chains of words that use all 12 letters, fewest words first, up to a word limit you set. Choose any chain to see it drawn on the board and explained word by word: the side of every letter, the letter that joins it to the word before, and the new letters it adds. Every chain is re-checked against the rules before it is shown, a search that reaches its time or size limit is labelled unfinished rather than complete, and you can search the public-domain ENABLE list, your own word list, or both.

Your puzzle

Board and chosen chain

????????????

Chains appear here after a search, drawn one line per word.

Enter the three letters on each side, then choose Solve chains. The word list loads only when you ask for it.

Word list
Not loaded
Words that fit
Not searched
Chains
Not searched
Fewest words
None
Search
Not run

Rules checked: every side holds three letters and all 12 differ. A word needs at least the minimum length and may not put two letters from the same side next to each other, so a doubled letter never fits. Each word starts with the last letter of the word before, no word repeats, and a chain ends at the word that uses the last of the 12 letters. Letters may be used more than once.

Word list: ENABLE 1.0, 172,823 public-domain English words (1,743,363 bytes, size and SHA-256 checked before use), requested from this site only when you first solve or choose Load dictionary, then reused while the page is open. It includes rare and inflected words and is not any game's answer list.

Four boards worth trying

Choose Try to load a board, then Solve chains.

  • WORKBENCH boardW R B, O K E, N H Z, C A Y; up to 2 words
    1 chain: WORKBENCH → HAZY
  • PLAYGROUND boardP A G, L Y U, R N K, O D E; up to 3 words
    3,749 chains, 8 of them two words, such as PLAYGROUND → DUKE
  • HAIKU boardD A W, O K L, I U B, P H R; up to 2 words
    No two-word chain; a 3-word limit finds 8, such as HAIKU → UPBOW → WORLD
  • repeated-letter boardC A T, O R E, I N K, S A T
    Refused: A is on both the Top and Left sides
How the search works. Every word in the chosen list is first checked against your board, and the ones that fit are grouped by first letter. A background worker then lists every one-word chain, then every two-word chain, and so on to your limit, joining each word to one that starts with its last letter and keeping a chain only when its final word completes the 12 letters. It stops at 8 seconds, 250,000,000 steps or 10,000 chains, and then labels what it found as unfinished rather than complete. Every chain is checked again, separately from the search, before it is shown.

Common questions

What rules does this letter box solver check?
Each side holds three letters and all 12 must differ. A word needs at least the minimum length you choose, 3 by default, and may not put two letters from the same side next to each other, so a doubled letter never fits. Each word starts with the last letter of the word before, no word repeats, and a chain ends at the word that uses the last of the 12 letters. Letters may be used more than once.
Are these today's official Letter Boxed answers?
No. You type the letters yourself, and the tool never reads a daily puzzle or any game's answer list. It searches the public-domain ENABLE word list or words you supply, so the game you are playing may reject a word listed here or accept one that ENABLE lacks.
Which dictionary does it use?
ENABLE 1.0, a public-domain list of 172,823 English words. The 1,743,363-byte file is requested from this site only when you first solve or choose Load dictionary, then reused while the page is open, and its size and SHA-256 hash are checked before any word is used. It includes rare, archaic and inflected words, so some chains use words you may not know. If the file cannot load, the page says so and nothing is searched.
What does the word limit do, and why can a search stop early?
The limit is the most words a chain may have, from 1 to 5, and it starts at 2. The search lists every one-word chain, then every two-word chain, and so on up to the limit, fewest words first. Boards with common letters can have hundreds of thousands of three-word chains, so the search stops at 8 seconds, 250,000,000 steps or 10,000 chains and labels the result unfinished: the chains it found are shown, but it does not claim to have listed them all.
What does it mean when no chain is found?
When a search finishes with nothing, no chain of up to your word limit exists in the chosen word list, so raise the limit or add words. The D A W, O K L, I U B, P H R board in the worked examples has no two-word chain in ENABLE, while a three-word limit finds 8. A search that stopped early without finding anything says so separately, because that does not prove no chain exists.
Can I use my own word list?
Yes. Paste words separated by spaces, commas or new lines and choose Only my words, or ENABLE plus my words. Only the letters A to Z are accepted: an entry with anything else stops the search with the first such entry named, rather than being skipped. The page reports how many of your words fit the board and why the rest do not. Only my words downloads nothing, and your list is never saved or sent.
Is anything I type uploaded?
No. The only request this tool makes is for the fixed ENABLE file on this site, and your letters are not part of it. The search runs in a background worker in your browser. Once you change the board, its four sides and your settings are remembered in this browser for next time; a pasted word list stays in the open tab only.
Can I export the chains?
Copy all chains as plain text, or download them as a text file or a CSV. Every export holds every chain found, not only the page on screen, and says whether the search finished or stopped. The list on screen shows 25 chains a page, and choosing a chain draws it on the board with a table of the side of every letter and the new letters each word adds.

Every chain shown is re-checked against the rules it states: words of at least the minimum length, no two neighbouring letters from the same side, each word starting with the last letter of the word before, and all 12 letters used. Words come from the pinned public-domain ENABLE list or from words you supply, so the game you are playing may reject a listed word or accept one this list lacks. The tool never reads a daily puzzle, and no chain is an official answer.