Solving Boggle Using AI - Dynamic Programming + Trie in Python

Solving Boggle Using AI - Dynamic Programming + Trie in Python

Yacine Mahdid via YouTube Direct link

- Introduction:

1 of 20

1 of 20

- Introduction:

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Solving Boggle Using AI - Dynamic Programming + Trie in Python

Automatically move to the next video in the Classroom when playback concludes

  1. 1 - Introduction:
  2. 2 - What is Boggle:
  3. 3 - Demonstration of Algorithm:
  4. 4 - Algorithm Planning:
  5. 5 - What the heck is a trie?:
  6. 6 - Dictionary encoded as a trie:
  7. 7 - Finding a dictionary:
  8. 8 - Building a trie dynamically:
  9. 9 - Demonstration of Trie Building:
  10. 10 - Boggle Solving:
  11. 11 - Boggle Board as a Graph:
  12. 12 - Adjacency Matrix for Boggle:
  13. 13 - Boggle Solving creating the graph:
  14. 14 - Demonstration of graph creation:
  15. 15 - Traversing the Boggle Graph:
  16. 16 - Movement for traversal cut and jump:
  17. 17 - Traversing the Boggle Graph recursion:
  18. 18 - Final Demonstration:
  19. 19 - Conclusion:
  20. 20 - ° ͜ʖ °:

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.