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의 8개 리뷰 중 1~8
교육 기관: John C
•2022년 4월 27일
교육 기관: Ruchi C
•2020년 9월 21일
교육 기관: Alpa C
•2020년 9월 23일
교육 기관: Aditya P L
•2022년 1월 7일
교육 기관: AJAY T
•2020년 9월 20일
교육 기관: Yamini S
•2021년 11월 1일
교육 기관: PAULIN S
•2021년 10월 27일
교육 기관: 1412 k
•2020년 9월 30일
Coursera Footer
© 2022 Coursera Inc. All rights reserved.
