Boggle solver

Find English words by joining horizontally, vertically or diagonally adjacent cells. A cell may occur only once in each word. Select a word to see its numbered path; coordinates are available below the board. Each word is listed once with one deterministic path, ordered by decreasing letter count, then alphabetically. The supplied dictionary includes unusual and historical entries; inclusion does not guarantee acceptance in an official game.

Grid. Enter 2–7 rows with the same number of cells as rows, up to 4,096 characters. Compact rows such as RATS contain individual letters. With spaces, a cell can be A–Z, QU or .. A dot blocks a cell, not a wildcard. For example, QU I followed by A T is a 2×2 grid. Q alone stays q: unlike a traditional Qu die, u is never added automatically. In a compact row, QU is two separate cells. Upper/lower case and outer whitespace are ignored; accents, digits and blank inner rows are invalid.

Length and results. The minimum is 2–12 letters, not cells; longer words are still allowed. There is no scoring or timer. Browse 50 words per page. TXT contains all found words, including other pages. A partial search has an explicitly marked file and warning line.

Limits and storage. Search starts only on request and runs in cancellable portions. At 2,000,000 candidate-cell checks the result is marked incomplete: more words may exist. Editing, cancelling or clearing stops the active job and removes its output. Clearing keeps inputs. Valid inputs and completed results remain in memory across tool navigation; reload restores only inputs that fit the site’s small storage limit. A shared dictionary download may finish after cancellation without publishing an old result.