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

4.2
stars
18 ratings
4 reviews

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 - 4 of 4 Reviews for Create a Boggle Word Solver using recursion in Python

By Ruchi C

Sep 21, 2020

Clear instructions, good pace, fun project

By Alpa C

Sep 23, 2020

Lucid explanation, great course

By AJAY T

Sep 21, 2020

Good

By 1412 k

Sep 30, 2020

it can be improved, also it's a bit difficult to manage the screen in there and at-time the code visibility drops.