- Based on the word game Boggle where the aim is to find words in sequences of adjacent letters in a grid.
- The user can specify a grid size which is randomly filled with letters and a list of words generated.
- Uses recursion to search the grid avoiding the exponential search growth with larger grids.
- Demonstrates how both algorithms and data structures can impact on performance.
- Topics covered are algorithm creation, data structures, testing and recursion.
- This is an edit to existing code to make it work with Python 3.
- Compare with the python2 version of this code in another of my repositories.
Uses:
- Python 3.6
- Unitest library
- Tests exist for most functions in the boggle.py code.
- Code written by richardadalton for Code-Institute-Org
- Currently random letters rather than chosen from dice as per actual game.
- Does not support the Qu letter of the realworld game.
- Allows words of less than 3 letters.