Skip to main content
ilovecalcs logoilovecalcs.

Solver · Live

Boggle Solver — every word your grid can make.

Enter any Boggle letter grid and instantly find every valid word formed by tracing adjacent letters, sorted by length and score.

How it worksInstant

Interactive

Boggle Solver

Board size

Rows

4

Columns

4

3×3 to 8×8, any combination. Type “Q” for the Qu tile.

Loading full dictionary — a quick tap works with the starter list too.

Fill every tile — 0/16 done.

Click a cell and type a letter — arrow keys move between tiles, typing “Q” fills the Qu tile automatically.

Field guide

How the Boggle Solver works.

Boggle is a word game played on a grid of lettered dice: players trace paths through adjacent letters (including diagonals) to form words, and each letter tile can be used at most once per word. Unlike our Word Search Solver, which looks for a list of words you already know, this tool has no target list — it discovers every valid word the grid contains.

Using the solver

Enter your board's letters exactly as they appear (4×4, 5×5, 6×6, or a custom size), and the solver returns every valid word, sorted by length and score, each with its exact path highlighted on the grid.

The algorithm: trie-pruned depth-first search

A naive approach — trying every possible path through the grid — grows exponentially and would be far too slow. The solver avoids this with a trie (a prefix tree built from the full dictionary) plus depth-first search:

  1. Starting from every cell, the search extends one adjacent, unused letter at a time, tracking the current letter sequence.
  2. Before descending further, it checks the trie for whether any dictionary word even starts with the sequence so far. If not, that entire branch is abandoned immediately — no need to explore further paths that can never form a real word.
  3. Whenever the current sequence matches a complete word in the trie, it's recorded (with its path), and the search keeps extending in case a longer word shares the same prefix.

Because most letter sequences aren't the start of any English word, the trie check prunes the vast majority of the search tree almost instantly — which is why even a 6×6 board resolves in a fraction of a second.

Worked example

Suppose a path spells “QZ” so far. No English word begins with “QZ,” so the trie lookup fails immediately and the search abandons that branch without ever considering the (potentially dozens of) letters adjacent to the “Z” — a single failed prefix check can prune an entire subtree in one step.

Tips for solving it yourself

  • Scan for common prefixes. Corner and edge letters have fewer neighbors, so trace outward from them first to narrow options quickly.
  • Remember “Qu” counts as one tile. Official Boggle dice print “Qu” together, so factor that into word length and scoring.
  • Longer words score disproportionately more. An 8-letter find is worth as much as several short ones combined — worth the extra search time.

Disclaimer: This tool is an independent fan creation and is not affiliated with or endorsed by Hasbro, Inc. “Boggle” is a registered trademark of Hasbro, Inc. Word validity is based on a standard English word list and may differ from official tournament lists on a small number of entries.