Boggle Solveur

Finds every valid word in a Boggle / Wordhunt board: any path of adjacent cells (incl. diagonals) where no cell is reused.

Input

One row per line, exactly N letters per row. The wordlist is the same English dictionary used by the other word tools (~370k entries), pruned to a trie of just the grid letters for fast DFS.

Tip

Words are sorted longest first. Min-word-length lets you discard short matches you would not score in the game.