grid below. Use "Q" for the "Qu" tile.

letters.

Play Boggle Online!


Recent Boards

l e v e 
a i f t 
t n u n 
s a r i 

Min. Length: 3
Size: 4x4
Solutions: 293
Score: 499
Solved: 41 sec ago
View Board

r a m n 
i w e g 
a e t t 
p o d s 

Min. Length: 4
Size: 4x4
Solutions: 143
Score: 232
Solved: 1 min ago
View Board

r e i b 
t m f w 
i r a e 
r h s t 

Min. Length: 4
Size: 4x4
Solutions: 221
Score: 410
Solved: 2 min ago
View Board

s a c k 
c r o i 
s a d e 
l p n s 

Min. Length: 3
Size: 4x4
Solutions: 380
Score: 760
Solved: 2 min ago
View Board

h n o d 
s p r i 
h e a e 
t s t s 

Min. Length: 3
Size: 4x4
Solutions: 547
Score: 1,288
Solved: 4 min ago
View Board

g a f o 
n e r d 
e c i e 
s o t s 

Min. Length: 3
Size: 4x4
Solutions: 538
Score: 1,193
Solved: 4 min ago
View Board

e u b o 
s m n t 
t s x o 
e i l r 

Min. Length: 4
Size: 4x4
Solutions: 74
Score: 115
Solved: 7 min ago
View Board

l o g b 
l e w x 
a a r x 
i i u v 

Min. Length: 3
Size: 4x4
Solutions: 101
Score: 132
Solved: 7 min ago
View Board

t h i w 
t w e e 
n e f c 
b v i r 

Min. Length: 3
Size: 4x4
Solutions: 80
Score: 90
Solved: 7 min ago
View Board

There have been a total of 484,945 solutions since May 2019.

About

Boggle is a word game where players race to find words hidden in a 4x4 grid of letters. From this site you can enter a Boggle board and see the resulting solutions. (You can also enter the tiles for a 3x3 or 5x5 board.) The results are stored in a database.

To display a particular board, visit EnterBoard.aspx?BoardID=boardID&Length=length&Size=gridSize, where: boardID is the list of tiles in the Boggle board; length is the minimum number of letters that must appear in a word to be considered a solution; and gridSize is the size of the grid - either 3, 4 or 5. To get the solutions in JSON, visit Solver.svc/?BoardID=boardID&Length=length.

For example, if you want to find all solutions with four or more letters using the 4x4 board:

r e i b
t m f w
i r a e
r h s t

Simply visit EnterBoard.aspx?BoardID=reibtmfwiraerhst&Length=4&Size=4 to see the solutions. To get the solutions in JSON, visit Solver.svc/?BoardID=reibtmfwiraerhst&Length=4&Size=4

How It Works

The Boggle Solver loads in a dictionary of words from a text file into a hashtable structure. The hashtable uses the first n letters of the word as the key, where n is the minimum length of a word to consider. At each hashtable bucket I store the list of strings that start with those n letters.

The solutions are found by starting at each of the tiles and then recursively examining the board for solutions. Because the same solution may be arrived at through different paths, duplicate solutions are ignored.

For more information on this application, see my article: Creating an Online Boggle Solver.