boggle-solver

Gives a list of all valid words in a Boggle board.

A Boggle board is an n * n board of tiles. Each tile has either one letter of the alphabet (not including "Q") or "Qu".

A valid word is one which can be made from adjacent tiles (including diagonally adjacent tiles). Each tile can be used at most once for each word. A valid word is at least three letters long.

Tests

Travis-CI runs all of the tests on various versions of Python.

Run the tests locally using:

python -m unittest discover

Plans

• Some kind of interface. Maybe a GUI, maybe a CLI.
• A generator to create random games.
• Multiple language support.