The CIS 5210 Podcast
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.
8 jaksot
Kommentit
0Ole ensimmäinen kommentoija
Rekisteröidy nyt ja liity The CIS 5210 Podcast-yhteisöön!