Scribd
Upload
40 views1 page

Comparison of Uninformed Search Techniques

The document compares four uninformed search techniques: Breadth-First Search (BFS), Depth-First Search (DFS), Iterative Deepening DFS, and Uniform Cost Search (UCS). Each technique has distinct advantages and disadvantages, such as BFS guaranteeing the shortest path but requiring high memory, while UCS ensures optimal solutions for weighted graphs but has higher computational overhead. The comparisons serve as a guide for selecting the most suitable search method based on specific problem needs.

Uploaded by

savita rathore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
40 views1 page

Comparison of Uninformed Search Techniques

The document compares four uninformed search techniques: Breadth-First Search (BFS), Depth-First Search (DFS), Iterative Deepening DFS, and Uniform Cost Search (UCS). Each technique has distinct advantages and disadvantages, such as BFS guaranteeing the shortest path but requiring high memory, while UCS ensures optimal solutions for weighted graphs but has higher computational overhead. The comparisons serve as a guide for selecting the most suitable search method based on specific problem needs.

Uploaded by

savita rathore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Comparison of Uninformed Search Techniques

Search Description Advantages Disadvantages


Technique

Breadth-First Explores all nodes at the present - Guarantees the - High memory
Search (BFS) depth before moving on to nodes shortest path in consumption, as it stores all
at the next depth level. unweighted graphs. nodes at the current depth.
- Completeness: will
find a solution if one
exists.

Depth-First Explores as far as possible along - Low memory usage - Does not guarantee the
Search (DFS) each branch before backtracking. compared to BFS. shortest path.
- Can be more efficient - Can get stuck in deep
for deep solutions. paths (infinite loops).

Iterative Combines the space efficiency of - Completeness and - More time-consuming due
Deepening DFS with the optimality of BFS by optimality for to repeated exploration of
DFS gradually increasing depth limits. unweighted graphs. nodes.
- Uses less memory
than BFS.

Uniform Cost Expands the least cost node first, - Guarantees the - Higher computational
Search (UCS) ensuring that the path cost is optimal solution for overhead due to cost
minimized. weighted graphs. calculations.
- Completeness: will - Can be slow if there are
find a solution if one many low-cost paths.
exists.

• Breadth-First Search is ideal for scenarios where finding the shortest path is critical,
but its high memory requirement can be a limitation in large search spaces.
• Depth-First Search is more memory efficient but risks missing the optimal solution
and can become inefficient in certain configurations.
• Iterative Deepening DFS offers a balanced approach, providing both completeness
and optimality while managing memory usage effectively.
• Uniform Cost Search excels in weighted scenarios, ensuring optimal solutions but
can be computationally expensive.
These comparisons highlight the strengths and weaknesses of each uninformed search
technique, providing a framework for selecting an appropriate method based on specific
problem requirements.

You might also like