Advantage to depth first search, Computer Engineering

Advantage to depth first search:

It just looks like it will be a long period it finds 'DAN' until. This highlights an important drawback for depth first search. It can regularly go deep down paths for which we have no solutions, when there may be we get any solution much higher ups the tree, although on a different branch. Also, depth for first search is not, in generally, may be complete. 

Rather than basically adding the next agenda item directly needs to the top of the agenda, it might be a superior idea to make sure that every node in the tree is fully expanded before moving on to the next depth in the search. This is other kind of depth first search which the Russell and Norvig explain in their rules and regulation. For our DNA example we see that, if we did this, the search tree would like this: 

And the big advantage to depth first search is just that it requires very much less memory to operate and control than breadth first search. If we just count the number of 'alive' nodes in the figure above, it amounts to only 4, just because the ones on them in the bottom row are not to be expanded due to the depth edge. However, it can be shown that if there an agent wants to search for all solutions then up to a depth of d in a space with branching factor b, and in a depth first search its only needs to remember up to a more maximum of b*d states at any one time easily. 

To put this in the perspective, if there our professor wanted to search for all names up to length 8, she would only have to remember that 3 * 8 = 24 for different strings to complete the procedure a depth first search is rather than 2187 in a breadth first search.

Posted Date: 1/9/2013 7:20:48 AM | Location : United States







Related Discussions:- Advantage to depth first search, Assignment Help, Ask Question on Advantage to depth first search, Get Answer, Expert's Help, Advantage to depth first search Discussions

Write discussion on Advantage to depth first search
Your posts are moderated
Related Questions
Common channel signalling              ? Common channel signalling requires no additional transmission help or facilities.

Cutoff Search : To require a mini and max search in a game on stage situation is, in which all we have is just do that programme our agent to look at the intact that search tr

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the asci

Illustrates about Metal Fix. A Metal Fix implies that only the upper metal interconnects layers are influenced. Connections may be made or broken, but new cells may not be adde

What are the advantages of Public Key Cryptography? Advantages of Public Key Cryptography are illustrated in below: a) Increased convenience and security and b) Electro

What do you mean by complexity of an algorithm? The term complexity is used to define the performance of an algorithm. Typically performance is calculated in terms of time or s

What are the characteristics of SRAM? SRAM are fast They are volatile They are of high cost Less density

Q. What is Parallel Balance Point? In order to execute parallel algorithm on parallel computer K processors are necessary. It should be noted that given input is allocated to

The basic project will have each group generate a sequence of 1's and 0's using  the Motorola 688HC11 board to turn ON and then turn OFF the TV set installed in ATRC 306. Each tele

Explain the Product of Sum Form - standard forms? The POS is the Boolean Expression containing OR terms, called as sum terms. The product denotes ANDing of these terms. F= (