TECHNICAL REPORT WRITING ON

SUBMITTED BY-

NAME: PRIYANKA GHOSH

DEPARTMENT: MCA

SEMESTER: III

ROLL NUMBER: 16971021025

DEPARTMENT OF MCA

ACADEMY OF TECHNOLOGY AEDCONAGAR,

HOOGHLY-712121 WEST BENGAL, INDIA

1. ABSTRACT :

As the name ‘Uninformed Search’ means the machine blindly follows the
algorithm regardless of whether right or wrong, efficient or in-efficient.
These algorithms are brute force operations, and they don’t have extra
information about the search space; the only information they have is on
how to traverse or visit the nodes in the tree.

2. INTRODUCTION :

Those uninformed search algorithms are also called blind search algorithms. The
search algorithm produces the search tree without using any domain
knowledge, which is a brute force in nature. They don’t have any
background information on how to approach the goal or whatsoever.
But these are the basics of search algorithms in AI.

Following are the various types of uninformed search algorithms:

1. Breadth-first Search
2. Depth-first Search
3. Depth-limited Search
4. Iterative deepening depth-first search
5. Uniform cost search
6. Bidirectional Search
 3. PROCEDURE AND DISCUSSION :

1. BREADTH-FIRST SEARCH :

 Breadth-first search is the most common search strategy for

traversing a tree or graph. This algorithm searches breadthwise in a
tree or graph, so it
is called breadth-first search.
 BFS algorithm starts searching from the root node of the tree
and expands all successor node at the current level before moving to
nodes of next level.
 The breadth-first search algorithm is an example of a general-
graph search algorithm.
 Breadth-first search implemented using FIFO queue data structure.

ADVANTAGES:
 BFS will provide a solution if any solution exists.
 If there are more than one solutions for a given problem,
then BFS will provide the minimal solution which requires the least
number of steps.

DISADVANTAGES:
 It requires lots of memory since each level of the tree must be
saved into memory to expand the next level.
 BFS needs lots of time if the solution is far away from the root node.

Complete: Yes (assuming b is finite)

Time Complexity: O(bd)

Space complexity: O(bd)

Optimal: Yes, if Step cost = 1 (i.e. no cost/all step costs are same)

2. DEPTH-FIRST SEARCH :

Depth-first search I a recursive algorithm for traversing a tree or graph data

structure.
  It is called the depth-first search because it starts from the root
node and follows each path to its greatest depth node before moving
to the next path.
 DFS uses a stack data structure for its implementation.
 The process of the DFS algorithm is similar to the BFS algorithm.
 ADVANTAGE:
 DFS requires very less memory as it only needs to store a stack of the nodes
on the path from root node to the current node.
 It takes less time to reach to the goal node than BFS algorithm (if it
traverses in the right path).

DISADVANTAGE:
 There is the possibility that many states keep re-occurring, and there is no
guarantee of finding the solution.
 DFS algorithm goes for deep down searching and sometime it may go to
the infinite loop.

Time Complexity: O(bm)

Space complexity: O(bm)

Optimal: DFS search algorithm is non-optimal, as it may generate a large

number of steps or high cost to reach to the goal node.

3. DEPTH-LIMITED SEARCH ALGORITHM :

A depth-limited search algorithm is similar to depth-first search with a predetermined limit.

Depth-limited search can solve the drawback of the infinite path in the Depth-first search. In
this algorithm, the node at the depth limit will treat as it has no successor nodes further.

Depth-limited search can be terminated with two Conditions of failure:

 Standard failure value: It indicates that problem does not have any solution.
 Cutoff failure value: It defines no solution for the problem within a given depth limit.

ADVANTAGE:
 Depth-limited search is Memory efficient.

DISADVANTAGE:
 Depth-limited search also has a disadvantage of incompleteness.
 It may not be optimal if the problem has more than one solution.

Completeness: DLS search algorithm is complete if the solution is above the

depth-limit.

Time Complexity: Time complexity of DLS algorithm is O(bl).

 Space Complexity: Space complexity of DLS algorithm is O(b×l).

Optimal: Depth-limited search can be viewed as a special case of DFS, and it is

also not optimal even if l>d.

4. UNIFORM-COST SEARCH ALGORITHM :

Uniform-cost search is a searching algorithm used for traversing a weighted tree or graph. This
algorithm comes into play when a different cost is available for each edge. The primary goal
of the uniform-cost search is to find a path to the goal node which has the lowest cumulative
cost. Uniform-cost search expands nodes according to their path costs form the root node. It
can be used to solve any graph/tree where the optimal cost is in demand. A uniform-cost
search algorithm is implemented by the priority queue. It gives maximum priority to the lowest
cumulative cost. Uniform cost search is equivalent to BFS algorithm if the path cost of all edges
is the same.

ADVANTAGE:
 Uniform cost search is optimal because at every state the path with the least cost is
chosen.

DISADVANTAGE:
 It does not care about the number of steps involve in searching and only concerned
about path cost. Due to which this algorithm may be stuck in an infinite loop.

Time Complexity: worst-case O(b1+[C*/ ε])/.

Space Complexity: worst-case O(b1+[C*/ ε]).

Optimal: Uniform-cost search is always optimal as it only selects a path with the
lowest path cost.

5. ITERATIVE DEEPENING DEPTH-FIRST SEARCH :

The iterative deepening algorithm is a combination of DFS and BFS algorithms. This search
algorithm finds out the best depth limit and does it by gradually increasing the limit until a
goal is found. This algorithm performs depth-first search up to a certain "depth limit", and it
keeps increasing the depth limit after each iteration until the goal node is found.
 ADVANTAGE:
 It combines the benefits of BFS and DFS search algorithm in terms of fast search and
memory efficiency.

DISADVANTAGE:
 The main drawback of IDDFS is that it repeats all the work of the previous phase.

Completeness: This algorithm is complete is if the branching factor is finite.

Time Complexity: The worst-case time complexity is O(bd).

Space Complexity: The space complexity of IDDFS will be O(bd).

Optimal: IDDFS algorithm is optimal if path cost is a non- decreasing function

of the depth of the node.

6. BIDIRECTIONAL SEARCH ALGORITHM :

Bidirectional search algorithm runs two simultaneous searches, one form initial state called as
forward-search and other from goal node called as backward-search, to find the goal node.
Bidirectional search replaces one single search graph with two small subgraphs in which one
starts the search from an initial vertex and other starts from goal vertex. The search stops when
these two graphs intersect each other. Bidirectional search can use search techniques such as
BFS, DFS, DLS, etc.

ADVANTAGE:
 Bidirectional search is fast and less memory required.

DISADVANTAGE:
 Implementation of the bidirectional search tree is difficult.

Completeness: Bidirectional Search is complete if we use BFS in both searches.

Time Complexity: Time complexity of bidirectional search using BFS is O(bd).

Space Complexity: Space complexity of bidirectional search is O(bd).

Optimal: Bidirectional search is Optimal.

4. CONCLUSION :

Search algorithms are algorithms that help in solving search problems. A search problem
consists of a search space, start state, and goal state. These algorithms are important because
they help in solving AI problems and support other systems such as neural networks and
production systems. The main properties of search algorithms include optimality, completeness,
time complexity, and space complexity. The main applications of search algorithms include
vehicle routing, nurse scheduling, record retrieval, and industrial processes.

5. REFERENCE :

I. Artificial Intelligence A Modern Approach, Stuart Russel Peter Norvig, Pearson

2. Artificial Intelligence, Ritch & Knight, TMH

3. Hidayat, Wahyu & Susanti , Fitri& Wijaya, Dedy. (2021). A Comparative Study of
Informed and Uninformed Search Algorithm to Solve Eight-Puzzle Problem. Journal of
Computer Science. 17. 1147-1156. 10.3844/jcssp.2021.1147.115