This episode explores adversarial search in game-playing AI, covering game formulation, minimax, game trees, evaluation functions, alpha-beta pruning and expectimax. Disclosure: This episode was generated using NotebookLM by uploading Professor Chris Callison-Burch's lecture notes and slides.
Podzilla Summary coming soon
Sign up to get notified when the full AI-powered summary is ready.
Free forever for up to 3 podcasts. No credit card required.
Listen to This Episode
More from The CIS 5210 Podcast
CIS 5210 - Module 8 - Reinforcement Learning
CIS 5210 - Module 7 - Markov Decision Processes
CIS 5210 - Module 6 - Knowledge-Based Agents and Logical Reasoning
CIS 5210 - Module 5 - CSPs
Get summaries like this every morning.
Free AI-powered recaps of The CIS 5210 Podcast and your other favorite podcasts, delivered to your inbox.
Free forever for up to 3 podcasts. No credit card required.