Create a Boggle Word Solver using recursion in Python

4.5
stars

33 ratings

Offered By

3,310 already enrolled

In this Guided Project, you will:
1 hour
Intermediate
No download needed
Split-screen video
English
Desktop only

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.

Skills you will develop

  • Recursion

  • Python Programming

  • Tree (Data Structure)

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:

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

Frequently Asked Questions