Iterative deepening search-artificial intelligence, Basic Computer Science

Iterative Deepening Search- Artificial intelligence:

So, breadth first search is guaranteed to find a solution (if one exists), but it grape whole memory. However, Depth first search is much less memory hungry, but not guaranteed to search  a solution. Is there any other approach to search the space which combines the good parts of both?

Well, yes there is a way exit  but it sounds stupid Iterative Deepening Search (IDS) is just a series of depth initial searches where the depth limit is increased by one each time. That is, an

Iterative Deepening Search will do a depth first search (DFS) to depth one , followed by a DFS to depth  two, and  furthermore , every  time beginning fully  from scratch. This has the advantage of complete, as it take  all depths of the search tree. Also, it just requires the same memory as depth first search.

However, you will have note that this means that it fully re-searches the entire space searched in the earlier iteration. This kind of redundancy will definitely make the search strategy too slow to contemplate using in practice? In fact, it isn't as bad as you might think. In a depth first search, this is because most of the effort is spent expanding the last row of the tree, so the replication over the top part of the tree is not a major factor.  Actually, the effect of the repetition reduces as the branching rate increases. In a search with branching rate ten and depth five, the number of states searched is 111,111 with a single depth first search. This number reached up to 123,456 with an iterative deepening search. So, there is only a repetition of around 11%.

Posted Date: 10/2/2012 2:15:26 AM | Location : United States







Related Discussions:- Iterative deepening search-artificial intelligence, Assignment Help, Ask Question on Iterative deepening search-artificial intelligence, Get Answer, Expert's Help, Iterative deepening search-artificial intelligence Discussions

Write discussion on Iterative deepening search-artificial intelligence
Your posts are moderated
Related Questions
They transfer the process flow, provisionally or totally, to a destiny, replicating this action until the counter is zero. LOOP LOOPE LOOPNE LOOP INSTRUCTION reason: To produce a c

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no


Flowcharting: Flowcharting: A Flowchart is a graphical representation of an algorithm. It can be compared to the blueprint of a building. Just as a building contractor refers

Question 1 What are the various skills needed for broadcasting and film? Question 2 What is a 2 dimensional animations and 3 dimensional animations? Question 3 Different

Product of first n natural numbers - Algorithm Working Procedure : 1. Take n = 8 2. Take I = 1 3. Take PROD = 1 4. Compute PROD = PROD * 1 5. add 1 to 1 6. If I≤ n, complete

I NEED FLOW CHART ANT DRAWINGS OF BASIC OPERATIONS OF COMPUTER

In this problem we will compare the performance of a vector processor with a system that contains a scalar processor and a GPU-based coprocessor. In the hybrid system, the host pr

Python is an interpreted, high-level, interactive and object oriented-scripting language. Python was designed to be extremely readable which uses English keywords commonly where as

Question A What is fragmentation? Explain its significance Question B Briefly discuss the functions of transport layer Question C What is CIDR? Explain Question D W