Create a Boggle Word Solver using recursion in Python
Create a Boggle Word Solver in Python by defining various functions that load a 4x4 game board based on input.
Recursively search in all allowed directions for plausible words using Depth First Traversal.
Learn to store the dictionary in a trie data structure which makes for more efficient lookups.
Showcase this hands-on experience in an interview
In this 1-hour long project-based course, you will have created a Boggle Word Solver in Python by defining various functions that load a 4x4 game board based on input, recursively searches in all allowed directions for plausible words using Depth First Traversal, and then prints out the valid words based on length constraints and by cross-checking whether the word exists in the stored dictionary. You will also learn to store the dictionary in a trie data structure which makes for more efficient lookups. This guided project is aimed at learners who are wanting to learn or practice recursion and graph traversal concepts in Python by developing a fun game. Understanding DFS and recursion is essential and will greatly expand your programming potential as they are used at the base of various algorithms. Implementing a prefix tree will also help you understand a new efficient data structure. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.
Familiarity with basic Python programming - specifically define and call functions, nested loops and know the basic data structures in Python.
Skills you will develop
Learn step-by-step
In a video that plays in a split-screen with your work area, your instructor will walk you through these steps:
Load the dictionary and initialize a game board based on input.
Create a class Tree to store the dictionary and define a function search to locate a letter in the Tree, and add a word, letter by letter to the tree structure.
Determine the base cases for the actual traversal of the board to find valid words.
Use recursion to create all possible strings of letters on the board.
Complete the main function by calling the above defined functions and display the output, successfully developing a Boggle Word Solver.
How Guided Projects work
Your workspace is a cloud desktop right in your browser, no download required
In a split-screen video, your instructor guides you step-by-step
Instructor
Frequently asked questions
Frequently Asked Questions
Are Guided Projects available on desktop and mobile?
Who are the instructors for Guided Projects?
Can I download the work from my Guided Project after I complete it?
How much experience do I need to do this Guided Project?
Can I complete this Guided Project right through my web browser, instead of installing special software?
What is the learning experience like with Guided Projects?
More questions? Visit the Learner Help Center.
Coursera Footer
