Chevron Left
返回到 Create a Boggle Word Solver using recursion in Python

學生對 Coursera Project Network 提供的 Create a Boggle Word Solver using recursion in Python 的評價和反饋

32 個評分
8 條評論


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....

1 - Create a Boggle Word Solver using recursion in Python 的 8 個評論(共 8 個)

創建者 John C


This was a conceptually challenging course for me - I had to comment all the way through the code to document my understanding, but the instructor was very good at explaining as they went along. I understood all the code, but really needed those explanations for the Trie data structure and the search algorithm. I learned a lot.

創建者 Ruchi C


Clear instructions, good pace, fun project

創建者 Alpa C


Lucid explanation, great course

創建者 Aditya P L



創建者 AJAY T



創建者 Yamini S






創建者 1412 k


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