Chevron Left
Volver a Create a Boggle Word Solver using recursion in Python

Opiniones y comentarios de aprendices correspondientes a Create a Boggle Word Solver using recursion in Python por parte de Coursera Project Network

4.5
estrellas
33 calificaciones

Acerca del Curso

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....
Filtrar por:

1 - 8 de 8 revisiones para Create a Boggle Word Solver using recursion in Python

por John C

27 de abr. de 2022

por Ruchi C

21 de sep. de 2020

por Alpa C

23 de sep. de 2020

por Aditya P L

7 de ene. de 2022

por AJAY T

20 de sep. de 2020

por Yamini S

1 de nov. de 2021

por PAULIN S

27 de oct. de 2021

por 1412 k

30 de sep. de 2020