The document discusses different types of searching algorithms, including uninformed and informed searching. It provides examples of uninformed searching algorithms like breadth-first search (BFS), depth-first search (DFS), and uniform cost search (UCS). BFS explores all nodes level-by-level, DFS explores nodes as deep as possible first before backtracking, and UCS finds the lowest total cost path using a priority queue.
3. ISA
Types of searching algorithm
Uninformed
searching
Informed
searching
• explore the search space
without any additional
knowledge about the
goal state
• visit nodes in a
systematic manner, such
as by visiting all possible
nodes or states in the
search space
4. ISA
Types of searching algorithm
Informed
searching
Uninformed
searching
• use additional
information or heuristics
to guide the search
process
• Heuristics are estimates
of the cost or distance to
the goal state
5. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching
explores all nodes
at the same level
before moving on
to the next level
find the shortest
path between two
nodes if one exists
6. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching
explores all nodes at
the same level
before moving on to
the next level
find the shortest
path between two
nodes if one exists
explores as far as
possible along each
branch before
backtracking
are not guaranteed
to find the shortest
path
7. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching
explores all nodes
at the same level
before moving on
to the next level
find the shortest
path between two
nodes if one exists
explores as far as
possible along each
branch before
backtracking
are not guaranteed
to find the shortest
path
expands nodes in
order of their path
cost, which is the total
cost of the path from
the start node to the
current node
are not guaranteed to
find the shortest path