Blind Search Algorithms

Trees:
?Consists of nodes connected by links (or edges).
?every node has a single parent.
?The root has no parents.
?No cycles exist.
?Graphs:
?Consists of nodes connected by links (or edges).
?Nodes have any number of parents.
?Cycles may exists
Graphs are divided based on the type of edges they have:
–Undirected graphs: are graphs where the edges between nodes have no direction.
–Directed graphs: are graphs where the edges have a direction. In this case, we can move from a node to another only in the edge direction.
4
A General Tree Search Algorithm
Input: State Space
Ouput: failure or path from a start state to a goal state.
Assumptions: L is a list of nodes that have not yet been examined.
The state space is a tree where each node has a single parent.
1.Set L to be a list of the initial nodes in the problem.
2.While L is not empty
1.Pick a node n from L.
2.If n is a goal node
1.stop and return it and the path from the initial node to n.
Else
1.remove n from L and add all of n’s children to L labelling each with its path from the initial node.
End while
Return failure
9