Introduction
Boggle is a word search game where you find words by chaining adjacent letters on a grid. Each cell connects to its eight neighbors (including diagonals), and you cannot reuse a cell within a single word. This solver runs a depth-first search from every cell, builds strings by walking adjacent letters, and checks each prefix against a dictionary to prune dead ends early. Paste your grid letters, pick a grid size, and the tool lists every valid word with its Boggle score.
What this tool does
- Find all valid words on a 3x3, 4x4, or 5x5 Boggle grid by performing depth-first search from every cell, walking to adjacent cells (including diagonals)
- Score words using standard Boggle rules: 3-4 letters score 1 point, 5 letters score 2, 6 letters score 3, 7 letters score 5, and 8 or more score 11
- Prune the search early using a prefix set, so if no dictionary word starts with the current string, the DFS backtracks immediately instead of exploring dead branches
- Enforce the no-reuse rule with a visited-cell array, ensuring each cell is used at most once per word
- Sort results by word length (longest first) then alphabetically, with a total score sum, capped at 500 words
- Run entirely in the browser with no server calls, so your grid letters never leave your device
How this tool works
The tool takes a string of grid letters and a grid size (3, 4, or 5). It normalizes the input to uppercase, strips non-letter characters, and checks that enough letters were provided (9 for 3x3, 16 for 4x4, 25 for 5x5). It then arranges the letters into a 2D grid.
Before searching, the tool builds two sets from the word list: a wordSet containing all dictionary words of length 3 or more, and a prefixSet containing every prefix of every word (so "ca" is in the prefix set if any word starts with "ca"). The prefix set is what makes the search fast. Without it, the DFS would explore every possible path on the grid, which for a 4x4 grid is astronomically large. With prefix pruning, most paths die after 2 or 3 letters because no dictionary word starts with that string.
The DFS starts from every cell. At each cell, it appends the letter to the current string, checks if the new string is a prefix of any dictionary word (via the prefixSet), and if not, backtracks. If the string is a valid word (in wordSet) and at least 3 letters long, it adds the word to the found set. It then recurses into all 8 adjacent cells that have not been visited, marking the current cell as visited before recursing and unmarking it afterward.
After the search completes, the tool sorts the found words by length descending, then alphabetically, and computes the total Boggle score using the standard scoring table. Results are capped at 500 words. The entire computation runs in a React useMemo, so results update on every keystroke.
How Boggle solving works (DFS with prefix pruning)
Boggle was designed by Allan Turoff and originally published by Parker Brothers in 1972. The game ships with a 4x4 grid of lettered dice in a dome, and players have three minutes to find words by chaining adjacent letters. Parker Brothers was acquired by Hasbro in 1991, and Hasbro continues to publish Boggle today (Wikipedia: Boggle).
The standard Boggle scoring table awards points by word length: 3-4 letters are worth 1 point, 5 letters worth 2, 6 letters worth 3, 7 letters worth 5, and words of 8 or more letters worth 11. This scoring table is used in the original Parker Brothers rules and in most tournament play. The tool implements this table directly.
Tournament Boggle, organized by the National Scrabble Association and later by Hasbro, uses a 4x4 grid with modified dice distributions designed to produce more vowels and common letter combinations. Tournament rules also disallow proper nouns, contractions, hyphenated words, and words requiring apostrophes. The word list in this tool is a general English dictionary and does not enforce those exclusions.
The algorithm behind a Boggle solver is a depth-first search with trie-based pruning. The key insight is that you do not need to explore paths whose prefix matches no dictionary word. A trie (prefix tree) or a hash set of all prefixes achieves this. The time complexity is O(N * 8^L) in the worst case without pruning, where N is the number of cells and L is the maximum word length, but prefix pruning reduces this dramatically in practice. For a 4x4 grid with a typical English dictionary, the search completes in well under a second.
The no-reuse constraint is what distinguishes Boggle from a simple word search. Each cell can appear at most once in a word, which means the DFS must track visited cells and backtrack. This is implemented with a boolean visited array that is set before recursing into a cell and cleared after returning. For word-finding without grid adjacency constraints, see the Crossword Clue Solver. For unscrambling letters without adjacency rules, use the Word Scramble Solver.
How to use this tool
- Select a grid size: 3x3 (9 letters), 4x4 (16 letters, standard Boggle), or 5x5 (25 letters, Big Boggle)
- Enter your grid letters in the main input field. Type them left to right, top to bottom. For example, for a 4x4 grid enter 16 letters like ABCDEFGHIJKLMNOP. Non-letter characters are ignored
- The tool builds the grid, constructs the prefix set, and runs DFS from every cell. Results appear instantly in the output panel
- Read the output: the number of words found, the total Boggle score, and each word in uppercase with its point value in parentheses
- Words are sorted longest first, then alphabetically. The minimum word length is 3 letters, matching standard Boggle rules
- If you get an error about insufficient letters, make sure you entered enough for the selected grid size (9, 16, or 25)
Real-world examples
Standard 4x4 grid with common letters
Grid: `ABCDEFGHIJKLMNOP` (4x4). The tool arranges this as A B C D / E F G H / I J K L / M N O P. The DFS finds words like ABF, EFI, INK, AFKJ (if in dictionary), and others. The output lists each word with its point value and a total score. With this particular grid, most words are short (3-4 letters, worth 1 point each) because the letter distribution is sequential and not optimized for word formation.
A vowel-rich grid producing long words
Grid: `RATSELINEPASWORT` (4x4), arranged as R A T S / E L I N / E P A S / W O R T. The DFS finds words like RAT, LINE, PINE, WORT, RATS, TINE, PAST, and longer chains like ELINES (if valid). Words of 5+ letters score higher (2 points for 5 letters, 3 for 6). The prefix pruning ensures the search does not waste time on strings like ZXQ that match no dictionary prefix.
3x3 grid for quick verification
Grid: `CATDOGRUN` (3x3), arranged as C A T / D O G / R U N. The tool finds CAT, DOG, RUN, and potentially TOG, OUR, and other 3-letter words formed by adjacent chains. Each word scores 1 point. This is useful for verifying a small grid or testing the solver's behavior. The 3x3 grid has fewer paths than 4x4, so the search is nearly instant.
5x5 Big Boggle grid
Grid: 25 letters for a 5x5 grid. Big Boggle (also called Boggle Deluxe) uses a 5x5 grid and allows words of 4 or more letters in some rule variants. This tool still uses a 3-letter minimum. The larger grid produces more words and longer chains, but the prefix pruning keeps the search fast. Results are capped at 500 words, which is usually sufficient for a 5x5 grid.
Comparison with similar methods
| Method | Complexity | Typical use |
|---|---|---|
| This tool (DFS + prefix set pruning) | O(N * 8^L) worst case, much less with pruning | Boggle grids of 3x3, 4x4, or 5x5 with standard scoring |
| DFS with trie data structure | O(N * 8^L) with O(1) prefix checks | Same algorithm, trie replaces hash set for prefix lookup |
| Brute force (no prefix pruning) | O(N * 8^L) always | Theoretical baseline, impractical for 4x4 and larger grids |
| Word Scramble Solver | O(n * L log L) | Finding words from scrambled letters without adjacency constraints |
| Jumble Solver | O(n * L log L) | Unscrambling jumbled letter sets for newspaper Jumble puzzles |
Limitations or considerations
The word list is a general English dictionary bundled with the page. It may include or exclude words depending on the dictionary source, and it does not enforce tournament Boggle rules (no proper nouns, no contractions, no hyphenated words). If you are playing tournament Boggle, verify found words against the official word list.
The tool uses standard Boggle scoring (3-4 letters: 1 point, 5: 2, 6: 3, 7: 5, 8+: 11). Some Boggle variants use different scoring tables, such as Big Boggle which may require 4-letter minimum words or use different point values. The tool does not support custom scoring tables.
The tool does not handle the Qu tile. In physical Boggle, one die face shows Qu, which counts as two letters. This tool treats every character as a single letter, so a Q in the grid matches only Q, not QU. If your grid has a Qu tile, enter it as Q and adjust manually.
Results are capped at 500 words. For a 5x5 grid with a dense dictionary, this cap may truncate the list. For word finding without grid adjacency, use the Word Scramble Solver or the Jumble Solver. For five-letter word puzzles, see the Wordle Solver.
Frequently asked questions
How does the DFS know which paths to explore and which to skip?
Before searching, the tool builds a prefix set containing every prefix of every dictionary word. During the DFS, after appending a letter to the current string, it checks if that string is in the prefix set. If not, no dictionary word starts with that string, so it backtracks immediately. This pruning eliminates the vast majority of paths and makes the search fast.
Can a cell be used more than once in a single word?
No. Standard Boggle rules prohibit reusing a cell within a single word. The tool enforces this with a visited-cell array. Before recursing into a cell, it marks it as visited. After returning from the recursion, it unmarks it so the cell is available for other words starting from different cells.
What scoring table does the tool use?
Standard Boggle scoring: 3-4 letter words score 1 point, 5-letter words score 2, 6-letter words score 3, 7-letter words score 5, and words of 8 or more letters score 11. This matches the original Parker Brothers rules. The total score is the sum of all found words' individual scores.
How do I enter letters for a 4x4 grid?
Type the 16 letters left to right, top to bottom. For example, if your grid is R A T S on the first row, E L I N on the second, E P A S on the third, and W O R T on the fourth, enter RATSELINEPASWORT. The tool ignores spaces, commas, and other non-letter characters, so you can format the input however you like.
Does the tool handle the Qu tile from physical Boggle?
No. The tool treats every character as a single letter. In physical Boggle, one die face shows Qu, which counts as two letters (Q and U). If your grid has a Qu tile, enter it as Q and note that the tool will not automatically append U. You may need to adjust your input or interpret results accordingly.
Conclusion
This Boggle solver finds every valid word on a 3x3, 4x4, or 5x5 letter grid using depth-first search with prefix pruning. The standard scoring table is built in, and the search runs in milliseconds in your browser. For word puzzles without grid adjacency, try the Crossword Clue Solver for pattern-based solving, the Word Scramble Solver for unscrambling letters, the Jumble Solver for newspaper Jumble puzzles, or the Wordle Solver for five-letter word deduction.