CIS 5210 - Module 4 - Adversarial Search
from The CIS 5210 Podcast Hosted by Chris Callison-Burch
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.
Embed this episode
No transcript yet.
Similar podcasts
Frequently asked questions
How long is this episode of The CIS 5210 Podcast?
This episode is 10 minutes long.
When was this The CIS 5210 Podcast episode published?
This episode was published on September 29, 2024.
Can I download this The CIS 5210 Podcast episode?
Yes. Use the download control on the episode player to save the publisher-provided media file.