3. Introduction
It is used to designed to address and solve
complex problems or tasks in its
environment. First the people needs to
analyze why problems are created..
PROBLEM
SOLVING
3
7. UNINFORMED
SEARCH
Uninformed searches,
also known as blind
searches, are search
algorithms that explore
a problem space
without using any
specific knowledge or
heuristics about the
problem domain
20XX
SAMPLE
FOOTER
TEXT
7
10. BFS
• The breadth-first search (BFS) algorithm is commonly used for
traversing trees or graphs, where it explores the neighboring
nodes in a breadth-first manner, visiting the nodes at the same
level before moving to the next level.
20XX 10
A
C
B
E
D F
G H
11. DFS
• Depth-first search (DFS) is an uninformed search algorithm that
helps traverse a tree or graph using the concept of
backtracking.
20XX SAMPLE FOOTER TEXT 11
A
B
E
D F
G H
C
12. CONCLUSION
• Uninformed search algorithms provide basic strategies for
exploring search spaces without additional knowledge about the
problem domain
12
14. Best-first Search Algorithm
• Greedy best-first search algorithm always selects the path
which appears best at that moment.
20XX SAMPLE FOOTER TEXT 14
15. A* Search Algorithm
• A* search is the most commonly known form of best-first
search. It uses heuristic function h(n), and cost to reach the
node n from the start state g(n).
• In A* search algorithm, we use search heuristic as well as
the cost to reach the node. Hence we can combine both
costs as following, and this sum is called as a fitness
number.
20XX SAMPLE FOOTER TEXT 15
