Lecture 12: Search Algorithms

author: Dennis Freeman, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 4, 2013,   recorded: March 2011,   views: 2654
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Categories

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

In this session, we introduce the idea of search. We've designed systems to tackle static problems and modeled the idea of uncertainty, but we still haven't developed a way to approach that uncertainty and engage in decision-making that we can codify into our systems.

We can tackle uncertainty through search; if we know the domain of possible solutions to a problem, and know the steps to get from one part of the domain to the other, then we can search the domain until we reach the solution.

The overview handout provides a more detailed introduction, including the big ideas of the session, key vocabulary, what you should understand (theory) and be able to do (practice) after completing this session, and additional resources.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: