Home / Boggle Solver
Boggle Solver
Type the letters from your grid into the boxes below in reading order, then solve. We trace every path through adjacent tiles — including diagonals — without reusing a tile twice in the same word, and list every real word we find.
How to use the Boggle solver
Set the grid size to match your game — 4×4 for classic Boggle, 5×5 for Big Boggle — then type the letter shown on each die into its box; typing auto-advances to the next tile. Hit Solve grid and we search every possible path: a word can move to any of the up to eight tiles touching its last letter, including diagonally, but it can never step onto the same tile twice within one word. Longer words score more in real Boggle, so results are sorted longest-first.
Worked example
Take this 4×4 grid:
T S P O
A R E L
M K D U
Q W I N
TRAM is in there: T (top-left) to R is a diagonal step, R to A is one cell left, A to M is one cell down — a path Boggle's grid-adjacency rule allows but a plain word-search grid wouldn't, since T and R aren't in the same row or column. STARE works too, moving only sideways and down across the top two rows. MARK is also there, built from four cells with no diagonal move at all — proof the solver isn't just hunting for diagonals, it checks all eight directions from every cell and never reuses one twice in the same word.
Frequently asked questions
- Does this work for any grid size?
- Yes — choose 3×3, 4×4, 5×5 or 6×6 to match the game you're playing. Classic Boggle is 4×4; Big Boggle is 5×5.
- Can a word reuse the same tile twice?
- No. The solver follows the real rule: each tile can only be used once per word. The same tile can still appear in other words found elsewhere in the grid.
- Does it count diagonal moves?
- Yes — from any tile you can move to any of its up to eight neighbours: up, down, left, right, and all four diagonals, exactly like the physical game.
- Why isn't a word I found in my head showing up?
- Double-check every letter was typed into the right box, and that the word meets the minimum length you selected. The solver checks against a curated common-word dictionary, so some valid but very obscure words may not appear yet.
