Create a Boggle Word Solver using recursion in Python

4.4
étoiles
30 évaluations
Offert par
Coursera Project Network
2 692 déjà inscrits
Dans ce Projet Guidé, vous :

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
IntermediateIntermédiaire
CloudAucun téléchargement requis
VideoVidéo en écran partagé
Comment DotsAnglais
LaptopOrdinateur de bureau uniquement

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.

Les compétences que vous développerez

  • Recursion
  • Python Programming
  • Tree (Data Structure)

Apprendrez étape par étape

Votre enseignant(e) vous guidera étape par étape, grâce à une vidéo en écran partagé sur votre espace de travail :

  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.

Comment fonctionnent les Projets Guidés

Votre espace de travail est un bureau cloud situé dans votre navigateur, aucun téléchargement n'est requis.

Votre enseignant(e) vous guide étape par étape dans une vidéo en écran partagé

Foire Aux Questions

Foire Aux Questions

D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.