Description
In the classic Parker Brothers game Boggle, players find words from a 4x4 game board of letters. This exercise is to make sure that a particular solution to a boggle board is actually available on the board.
The program does not need to check to make sure if the input word is a valid english word. Furthermore, all inputs will be in all uppercase, so the user does not need to check/convert for case differences. The game board will always be 4x4.
Note: This does not perfectly align with the rules of Boggle. Specifically, all solutions in the original game must be 3 or more letters, which this problem is not asking to account for, and the atomic "Qu" is present (which I have avoided in the test suite).
Happy MATLABing!
Example
x = ['TIPE'
'YECV'
'LSRA'
'WOTU'];
y = 'RACIEST';
TF = true;
Solve

Solution Stats

234 Solutions

58 Solvers

Last Solution submitted on Jan 12, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers58

CXD Mehdi Dehghan Clement Anubhav

Suggested Problems

More from this Author56

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!