Mega-Recitation 2: Basic Search, Optimal Search
Listen now
Description
This mega-recitation covers Problem 2 from Quiz 1, Fall 2008. We start with depth-first search and breadth-first search, using a goal tree in each case. We then discuss branch and bound and A*, and why they give different answers in this problem.
More Episodes
In this lecture, Prof. Winston discusses BLANK and modern breakthroughs in neural net research.
Published 03/04/16
In this video, Prof. Winston introduces neural nets and back propagation.
Published 03/04/16
This mega-recitation covers Problem 1 from Quiz 2, Fall 2007. We start with a minimax search of the game tree, and then work an example using alpha-beta pruning. We also discuss static evaluation and progressive deepening (Problem 1-C, Fall 2008 Quiz 2).
Published 11/25/13
Links
No website
No RSS feed
Twitter
Facebook
Instagram
Patreon
Genres
Artwork or description wrong?
Request an update »
Updates may take a few minutes.
Do you host a podcast?
Track your ranks and reviews from Spotify, Apple Podcasts and more.
See hourly chart positions and more than 30 days of history.
Get Chartable Analytics »
See hourly chart positions and more than 30 days of history.
