Create a Boggle Word Solver using recursion in Python
Offered By: Coursera Project Network via Coursera
Course Description
Overview
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.
Syllabus
- Project Overview
- By the end of this project, 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 structure which makes for more efficient lookups.
Taught by
Anusha Chheda
Related Courses
程序设计实习 / Practice on ProgrammingPeking University via Coursera 程序设计基础
Peking University via edX 算法基础
Peking University via Coursera Principles of Computing (Part 2)
Rice University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera