A package for auto-generating the possible combinations of a boggle grid.
Project description
Boggle Solver
A recursive method for finding all words in a given square grid.
Installation
No non-standard libraries needed.
Usage
Grid can be updated within the main.py file.
>> python3 main.py
['M', 'A', 'P']
['E', 'T', 'E']
['D', 'E', 'N']
completion:
1/9
...
9/9
complete
MET
MAT
...
PATEN
TEAMED
Words found: 46
Shortest word: MET
Longest word: TEAMED
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
boggle_solver-0.14.tar.gz
(166.8 kB
view hashes)
