Solving Boggle using AI : Dynamic Programming + Trie in Python

Published: 25 July 2023
on channel: Deep Learning with Yacine

1,247

Boggle is a very interesting game to solve programmatically as it teaches you a lot about data structure, graphs, performance and dynamic programming.

In this video we'll build a classical AI algorithm (i.e. not machine learning based, but graph-search based) to solve any boggle board in less than 10 seconds!

Table of Content
Introduction: 0:00
What is Boggle: 0:26
Demonstration of Algorithm: 2:15
Algorithm Planning: 3:02
What the heck is a trie?: 5:10
Dictionary encoded as a trie: 6:10
Finding a dictionary: 7:41
Building a trie dynamically: 8:56
Demonstration of Trie Building: 17:00
Boggle Solving: 18:00
Boggle Board as a Graph: 20:25
Adjacency Matrix for Boggle: 22:35
Boggle Solving (creating the graph): 24:04
Demonstration of graph creation: 28:22
Traversing the Boggle Graph: 29:12
Movement for traversal (cut and jump): 30:03
Traversing the Boggle Graph (recursion): 31:40
Final Demonstration: 34:56
Conclusion: 35:15
( ° ͜ʖ °): 35:31

Github for the source code is right here:
📌 https://github.com/yacineMahdid/ai-bo...

Jam is:
🎶 Love Teacher - Nicolas Jaar

----
Join the newsletter for weekly AI content: https://yacinemahdid.com
Join the Discord for general discussion:   / discord

----
Follow Me Online Here:

Twitter:   / yacineaxya
GitHub: https://github.com/yacineMahdid
LinkedIn:   / yacinemahdid
___

Have a great week! 👋

On this page of the site you can watch the video online Solving Boggle using AI : Dynamic Programming + Trie in Python with a duration of hours minute second in good quality, which was uploaded by the user Deep Learning with Yacine 25 July 2023, share the link with friends and acquaintances, this video has already been watched 1,247 times on youtube and it was liked by 16 viewers. Enjoy your viewing!

13,912

323