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
Q.Prove using Boolean Algebra 1. X (X+Y) = X 2. AB + AC + BC' = AC + BC' 3. (A+B+C) (A+B'+C') (A+B+C') (A+B'+C)=A 4. (A+B'+C) (AB+A'C) = (A+C) (A'+B) 5. XY + XZ + YZ

Balance The balance of an image can be thought of as the distribution of visual weight within the piece. A piece of art can be structured so that the elements create a sense of

Determine the concepts of Object Oriented Analysis  In OOA the initial focus is on identifying objects from the application domain, after that fitting those procedures around

What is parsing? Parsing is the process of analyzing a text, formed of a sequence of tokens, to find out its grammatical structure regarding a specified formal grammar. Parsing

Advantage of wrapping database calls into MTS transaction If database calls are complete within the context of a transaction, aborting the transaction will undo and changes that

What is socket inheritance? Explain. Socket Inheritance: In a socket inheritance a reference count mechanism is utilized. Whenever a socket is first created, the system set

What is time slicing? With this technique each program runs for a short period known as a time slice, and then another program runs for its time slice and so on.

Algorithm to insert a key in B-tree is as follows: 1.  First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into

Which interface converts SQL requirements in the SAP development system to those of the database? Database Interface converts SQL in the SAP.

State about the machine language programs The computer can run only machine language programs, one needs to translate above programs to machine language programs. To translate