Introduction to Artificial Intelligence: Minimax, Alpha-Beta Pruning, and Assignment 3 - Lecture 10

Introduction to Artificial Intelligence: Minimax, Alpha-Beta Pruning, and Assignment 3 - Lecture 10

Dave Churchill via YouTube Direct link

- Assignment 3 Explained

24 of 34

24 of 34

- Assignment 3 Explained

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Introduction to Artificial Intelligence: Minimax, Alpha-Beta Pruning, and Assignment 3 - Lecture 10

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

  1. 1 - Preroll
  2. 2 - Greetings
  3. 3 - Lecture Start
  4. 4 - Multiplayer Games
  5. 5 - Game Playing Algorithms
  6. 6 - Look-Ahead and Evaluate
  7. 7 - Game Tree Size
  8. 8 - Look-Ahead as Far as Possible
  9. 9 - Tree Search with Multiple Players
  10. 10 - MaxValue and MinValue Functions
  11. 11 - MiniMax Algorithm
  12. 12 - Megamax Algorithm
  13. 13 - MiniMax Properties & NE
  14. 14 - Alpha-Beta Pruning
  15. 15 - Alpha-Beta Visual Example
  16. 16 - Alpha-Beta Computational Savings
  17. 17 - Alpha-Beta MaxValue and MinValue
  18. 18 - Alpha-Beta Single Algorithm
  19. 19 - Shortening the Alpha-Beta Algorithm
  20. 20 - Recording the Best Action
  21. 21 - Implementing a Time Limit
  22. 22 - Iterative Deepening Alpha-Beta
  23. 23 - Exam Questions
  24. 24 - Assignment 3 Explained
  25. 25 - A3 GUI Explained
  26. 26 - A3 Testing Functions
  27. 27 - A3 Code - GameState
  28. 28 - Sample Players
  29. 29 - Player_Student
  30. 30 - IDAlpheBeta Function
  31. 31 - AlphaBeta Function
  32. 32 - Eval Function
  33. 33 - Marking Scheme
  34. 34 - AlphaBeta Debugging Tips

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.