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
It is desirable that operating speed of primary storage of a computer system be as fast as possible since most of the data transfer to and from processing unit is via main memory.

Enumerate the data structures used during the first pass of the assembler. Indicate the fields of these data structures and their purpose/usage. Three main data structures used

Explain Turing reducibility?  Exponential time algorithms typically happens when we solve by searching by a space of solutions known as brute -force search

What is Race condition? Race condition: The circumstances where several processes access - and manipulate shared data-concurrently. The last value of the shared data depends

INTEL ARCHITECTURE - 64 ( IA-64) IA-64 (Intel Architecture-64) is a 64-bit processor architecture developed in cooperation by Intel and Hewlett-Packard, executed by processors s

Q. Describe about general-purpose registers? The general-purpose registers as the name proposes can be used for several functions. For illustration they may comprise operands o

Error detecting method that can detect more errors without increasing additional information in each packet is? Error detecting method which can detect more errors without rais

What are the types of Subroutines? Internal Subroutines: The source code of the internal subroutines will be in the similar ABAP/4 program as the calling procedure (intern

what is computer

How can common bus system be constructed A common bus system could be constructed using multiplexers. These multiplexers select source register whose binary information is then