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.
フィルター：
Create a Boggle Word Solver using recursion in Python： 1 - 8 / 8 レビュー
by John C
•2022年4月27日
by Ruchi C
•2020年9月21日
by Alpa C
•2020年9月23日
by Aditya P L
•2022年1月7日
by AJAY T
•2020年9月20日
by Yamini S
•2021年11月1日
by PAULIN S
•2021年10月27日
by 1412 k
•2020年9月30日
Coursera Footer
©2022 Coursera Inc.All rights reserved.
