Scribd
Upload
95 views2 pages

Breadth First Search (Level Search)

The documents discuss various artificial intelligence and search algorithms concepts: 1) Soft computing uses approximate techniques like fuzzy logic compared to hard computing which uses precise techniques. Artificial intelligence is the study of intelligent agents that act and think rationally. Fuzzy logic allows partial set membership rather than crisp membership in classical binary sets. 2) Breadth-first search uses a queue and explores all neighbor nodes first before moving to the next level, finding the shortest path. Depth-first search uses a stack and explores as far as possible along each branch before backtracking, but may not find the shortest path. A* search uses an informed heuristic to estimate the cost to reach the goal, guaranteeing an optimal solution.

Uploaded by

Islamic India
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
95 views2 pages

Breadth First Search (Level Search)

The documents discuss various artificial intelligence and search algorithms concepts: 1) Soft computing uses approximate techniques like fuzzy logic compared to hard computing which uses precise techniques. Artificial intelligence is the study of intelligent agents that act and think rationally. Fuzzy logic allows partial set membership rather than crisp membership in classical binary sets. 2) Breadth-first search uses a queue and explores all neighbor nodes first before moving to the next level, finding the shortest path. Depth-first search uses a stack and explores as far as possible along each branch before backtracking, but may not find the shortest path. A* search uses an informed heuristic to estimate the cost to reach the goal, guaranteeing an optimal solution.

Uploaded by

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

https://www.geeksforgeeks.

org/difference-between-soft-computing-and-hard-computing/

https://www.geeksforgeeks.org/artificial-intelligence-an-introduction/

https://www.geeksforgeeks.org/fuzzy-logic-introduction/

Breadth First Search (level Search ) -


Uniformed Search Technique

FIFO(Queue)

Shoretest cost

Shortest path

No of nodes + no. of edges Complexity

B ki power d Branch factor – max child of node

D – depth

Complete

Depth First Search


Uniformed Search technique

Stack

Deepest Node

Complete

Brute force method

Incomplete

B ki power d

https://users.cs.cf.ac.uk/Dave.Marshall/AI2/node70.html

https://www.javatpoint.com/hill-climbing-algorithm-in-ai
A* Algorithm

Informed Searching Technique

Heuristic

F(n) = g(n)+R(n)

Cost = Actuat Cost from Start node to n + Estimate Cost From n to


Goal Node

Gurantee od Optimal solution

TC = Number of nodes + no of edges

B ki power d same for space

AO *

It does not explore all the solution path once it got the solution

You might also like