Skip to content

Recursive method for finding all English words in a grid.

License

Notifications You must be signed in to change notification settings

unplaceable/boggle_solver

Repository files navigation

made-with-python GitHub license boggle_test Actions Status

GitHub: github.com/euanacampbell/boggle_solver

PyPi: pypi.org/project/boggle-solver

Installation

pip3 install boggle-solver

Import

from boggle_solver import *

Usage

Create a 2-dimensional array and pass this into the package.

from boggle_solver import *

grid = [
        ['M','A','P'],
        ['E','T','E'],
        ['D','E','N'],
       ]

boggle=Grid(grid)

To confirm this worked, the below function can be used.

boggle.print_grid()

['M', 'A', 'P']
['E', 'T', 'E']
['D', 'E', 'N']

Now search for all words. This will take ~20 seconds for a 3x3 grid.

words = boggle.find_all_words()

print(words[:10])

['MEAT', 'MET', 'METED', 'MEET', 'MAT', 'MATE', 'MATED', 'MAP', 'EDEN', 'EAT']