Enter the characters into the 4x4 grid below. Use "Q" for the "Qu" tile.

Return words with at least letters.

Alternatively, you can enter all 16 letters as one string here:

Play Boggle Online!

Recent Boards

r s i c 
i t k e 
n e a r 
k a n e 

Min. Length: 4
Solutions: 74
Score: 129
Solved: 1 min ago
View Board

o i n u 
s r t n 
w a n u 
p s i s 

Min. Length: 3
Solutions: 261
Score: 399
Solved: 2 min ago
View Board

f r g r 
s e o b 
k e o m 
c i t s 

Min. Length: 3
Solutions: 310
Score: 518
Solved: 3 min ago
View Board

s n t o 
r l a w 
m t s f 
t n e j 

Min. Length: 3
Solutions: 158
Score: 206
Solved: 3 min ago
View Board

k s n o 
e g t s 
n a g e 
b e r a 

Min. Length: 3
Solutions: 396
Score: 900
Solved: 4 min ago
View Board

p m r y 
a e l i 
s p r o 
i s m p 

Min. Length: 3
Solutions: 236
Score: 412
Solved: 6 min ago
View Board

s e r m 
n g d i 
l i s l 
g a r e 

Min. Length: 3
Solutions: 442
Score: 935
Solved: 7 min ago
View Board

e o n h 
o t s i 
a r e t 
q a o m 

Min. Length: 4
Solutions: 286
Score: 625
Solved: 7 min ago
View Board

s p a t 
s t q h 
u b i h 
s v l h 

Min. Length: 3
Solutions: 71
Score: 89
Solved: 10 min ago
View Board

There have been a total of 286,756 solutions since February 2011.


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. The results are stored in a database.

To display a particular board, visit EnterBoard.aspx?BoardID=boardID&Length=length, where boardID is the list of tiles in the Boggle board and length is the minimum number of letters that must appear in a word to be considered a solution. 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 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 to see the solutions. To get the solutions in JSON, visit Solver.svc?BoardID=reibtmfwiraerhst&Length=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 16 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.