Chevron Left
Back to Create a Boggle Word Solver using recursion in Python

Learner Reviews & Feedback for Create a Boggle Word Solver using recursion in Python by Coursera Project Network

33 ratings

About the Course

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....
Filter by:

1 - 8 of 8 Reviews for Create a Boggle Word Solver using recursion in Python

By John C

Apr 27, 2022

By Ruchi C

Sep 21, 2020

By Alpa C

Sep 23, 2020

By Aditya P L

Jan 7, 2022


Sep 20, 2020

By Yamini S

Nov 1, 2021


Oct 27, 2021

By 1412 k

Sep 30, 2020