Depth first search algorithm assignment, Schemes and Mind Maps of Artificial Intelligence

This is my personal assignment file

Typology: Schemes and Mind Maps

2021/2022

Uploaded on 10/13/2022

omama-munir
omama-munir 🇵🇰

3 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Depth limited search algorithm
Similar to DFS but with a predetermined limited
Help in solving the problems DFS like infinite path termination condition
without finding solution.
1. Failure value
Where is no solution
2. Cut of failure
terminates on reaching predetermined depth no solution
Advantages
Memory efficient disadvantages
Disadvantages
Incompleteness
can be terminated without finding solution
Not optimal
it is not important they give best result
Time complexity O(bd)
space complexity O(b*d)
pf2

Partial preview of the text

Download Depth first search algorithm assignment and more Schemes and Mind Maps Artificial Intelligence in PDF only on Docsity!

1

Depth limited search algorithm

 Similar to DFS but with a predetermined limited  Help in solving the problems DFS like infinite path termination condition without finding solution.

  1. Failure value Where is no solution
  2. Cut of failure terminates on reaching predetermined depth no solution

Advantages

 Memory efficient disadvantages

Disadvantages

 Incompleteness

can be terminated without finding solution

 Not optimal

it is not important they give best result

 Time complexity O(b

d )

 space complexity O(b*d)

2