Boggle Solver
Enter your 4×4 Boggle grid to find every valid word.
Finds all paths through adjacent letters.
How to use the Boggle Solver
Click the first cell and type your 16 letters in order — the cursor advances automatically. Click Solve Boggle to find all valid words (minimum 3 letters) that can be traced through adjacent cells without reusing the same cell. Results are sorted by word length so you can spot the highest-scoring words immediately.
Boggle rules
- Words must be at least 3 letters long.
- Each die can only be used once per word.
- Letters must be adjacent horizontally, vertically, or diagonally.
- The "Qu" face counts as two letters (Q and U) in a single cell.
Boggle scoring
Boggle awards points based on word length, not letter values. Three- and four-letter words score 1 point each. Five-letter words score 2 points, six-letter words score 3 points, seven-letter words score 5 points, and eight-or-more-letter words score 11 points. Finding long words is far more valuable than finding many short ones — a single eight-letter word outscores eleven three-letter words.
Strategy tips
- Scan for common prefixes (UN-, RE-, OUT-) and suffixes (-ING, -ED, -ER, -EST) first.
- Corner and edge letters are harder to chain — focus on central letters that have more neighbours.
- Look for "stem" words you can extend: finding SAIL means SAILOR may also be on the board.
- Common high-value Boggle letters include S (plurals), R, and E (used in many suffixes).
How the solver works
The solver uses a depth-first search (DFS) algorithm to trace every valid path through adjacent cells. At each step it checks the current letter sequence against a prefix tree (trie) built from a 170,000-word dictionary — if no word starts with the current path, the search backtracks immediately. This makes the solver fast even for complex grids.