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
Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr

1. In discussing software algorithms for mutual exclusion, we noted that optimizing compilers and out-of-order execution by processors could invalidate most of these algorithms bec

Mike sells on the average 15 newspapers per week (Monday – Friday). Find the probability that 2.1 In a given week he will sell all the newspapers [7] 2.2 In a given day he will sel

"Just how are we capable to get a computer to performe intelligent tasks?" One thing to answer the question is to tell that: Logic generate a science out of many forms of re

A line holds only whitespace, probably with a comment, is identified as a blank line, and Python completely avoids it. In an interrelated interpreter session, you need to enter an

Question 1 Discuss the usage and benefits of storyboarding Question 2 Explain the different stages of scriptwriting Question 3 Explain the 12 fundamental principle

Question 1 List and explain the ways used to close an MS Word document Question 2 What is MS-Excel? List the steps involved in starting Microsoft Excel Question 3 What i

QUESTION (a) (i) Why is the Random class in the .NET framework not suitable for generating random bytes for cryptography purposes? (ii) Mention two characteristics required

Development of UNIX: The original UNIX development was performed on a Digital PDP-7 minicomputer and later moved to a PDP-11 minicomputer, the forerunner of the VAX computer.

Uninformed Search Strategies: To be able to undertake a regular search, our entire agent ought to know is the starting state, the possible operators and how to check whether th