Create a Boggle Word Solver using recursion in Python

4.4
별점
30개의 평가
제공자:
Coursera Project Network
2,694명이 이미 등록했습니다.
학습자는 이 안내 프로젝트에서 다음을 수행하게 됩니다.

Create a Boggle Word Solver in Python by defining various functions that load a 4x4 game board based on input.

Recursively search in all allowed directions for plausible words using Depth First Traversal.

Learn to store the dictionary in a trie data structure which makes for more efficient lookups. 

Clock1 hour
Intermediate중급
Cloud다운로드 필요 없음
Video분할 화면 동영상
Comment Dots영어
Laptop데스크톱 전용

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.

개발할 기술

  • Recursion
  • Python Programming
  • Tree (Data Structure)

단계별 학습

작업 영역이 있는 분할 화면으로 재생되는 동영상에서 강사는 다음을 단계별로 안내합니다.

  1. Load the dictionary and initialize a game board based on input.

  2. Create a class Tree to store the dictionary and define a function search to locate a letter in the Tree, and add a word, letter by letter to the tree structure.

  3. Determine the base cases for the actual traversal of the board to find valid words.

  4. Use recursion to create all possible strings of letters on the board.

  5. Complete the main function by calling the above defined functions and display the output, successfully developing a Boggle Word Solver.

안내형 프로젝트 진행 방식

작업 영역은 브라우저에 바로 로드되는 클라우드 데스크톱으로, 다운로드할 필요가 없습니다.

분할 화면 동영상에서 강사가 프로젝트를 단계별로 안내해 줍니다.

자주 묻는 질문

자주 묻는 질문

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.