Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Solving Boggle Using AI - Dynamic Programming + Trie in Python

Yacine Mahdid via YouTube

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
Build a Boggle solver using a trie to encode a dictionary and graph search to explore the board. The course covers creating the board graph and recursively traversing it to find words.

Syllabus

- Introduction:
- What is Boggle:
- Demonstration of Algorithm:
- Algorithm Planning:
- What the heck is a trie?:
- Dictionary encoded as a trie:
- Finding a dictionary:
- Building a trie dynamically:
- Demonstration of Trie Building:
- Boggle Solving:
- Boggle Board as a Graph:
- Adjacency Matrix for Boggle:
- Boggle Solving creating the graph:
- Demonstration of graph creation:
- Traversing the Boggle Graph:
- Movement for traversal cut and jump:
- Traversing the Boggle Graph recursion:
- Final Demonstration:
- Conclusion:
- ° ͜ʖ °:

Taught by

Yacine Mahdid

Reviews

Start your review of Solving Boggle Using AI - Dynamic Programming + Trie in Python

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.