logo-mooc
search-iconsearch-icon
menu-whitemenu-blue
GRATIS
Inicio / Buscador / Programación / Python
University of Illinois at Urbana-Champaign vía Coursera
GRATIS

Create a Boggle Word Solver using recursion in Python

  • money

    Cursos gratis (Auditar)

    question-mark
  • earth

    Inglés

  • folder

    Siempre Abierto

  • certificate

    Guía de Registro en Coursera

    arrow
VER CURSO arrow
Acerca de este curso

  • Project Overview
    • By the end of this project, 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 structure which makes for more efficient lookups.