Artificial Intelligence. Lecture 10. Outline. Problem Solving using Search Search consists of state space operators start state goal states A Search Tree is an efficient way to represent a search There are a variety of specific search techniques, including Depth-First Search
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
1. A set of states
2. A set of “operators” which allow one to get from one state to another
3. A start state S
4. A set of possible goal states G, or ways to test for goal states
EState Space Graph: Map Navigationnot to be confused with Search Tree!!
S = start, G = goal, other nodes = intermediate states, links = legal transitions
Process of removing irrelevant detail to create an abstract representation: ``high-level”, ignores irrelevant details
1. Every free tree with n vertices contains exactly n - 1 edges
2. If we add any edge to a free tree, we get a cycle
Vertex Adj. List
a (b, c, d, e)
b (a, d, e)
c (a, f, g)
d (a, b, e)
Vertex Adj. List
e (a, b, d)
f (c, g)
g (c, f)
DFS of an undirected graph involves only two types of arcs.
1. Tree arcs.
2. Back arcs
(there is no distinction between back arcs and forward arcs)
Cross arcs also don't exist because given any two vertices, if there exists an arc between them, then one of them will be an ancestor and the other a descendant in the DFS.
Breadth First Search is also known as Forward-Chaining
Graph search algorithms must eliminate loops from solution path