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

学生对 Coursera Project Network 提供的 Create a Boggle Word Solver using recursion in Python 的评价和反馈

33 个评分


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

Apr 27, 2022

创建者 Ruchi C

Sep 21, 2020

创建者 Alpa C

Sep 23, 2020

创建者 Aditya P L

Jan 7, 2022

创建者 AJAY T

Sep 20, 2020

创建者 Yamini S

Nov 1, 2021


Oct 27, 2021

创建者 1412 k

Sep 30, 2020