Boxed-letters chain solver

Type the three letters on each side of the board, top, right, bottom, and left. The solver looks for a chain of words that covers all twelve letters: each word starts with the last letter of the one before it, and no word puts two letters from the same side next to each other.

Set a word limit if you are chasing a short solution. If no chain inside the limit covers the board, the solver says so plainly and shows the best partial chain it found, with the letters still uncovered named.

This finder is a Pangramist tool. It is not part of any game, and it is not connected to the New York Times Company or its games.

It works from our own word list, ENABLE, a public domain list. The list a game uses and this list are different lists: ours runs wider in some places and narrower in others, so a word a game rejects can appear here and a word a game accepts can be missing. Counts on this page describe our list, never a game's list.