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.

ガイド付きプロジェクトの仕組み

ワークスペースは、ブラウザに完全にロードされたクラウドデスクトップですので、ダウンロードは不要です

分割画面のビデオで、講師が手順ごとにガイドします

よくある質問

よくある質問

さらに質問がある場合は、受講者ヘルプセンターにアクセスしてください。