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

Implement the following function using a 3 line to 8 line decoder. S (A,B,C) =   ∑ m(1,2,4,7) C (A,B,C) =  ∑ m ( 3,5,6,7)         Ans. Given function S (A,B,C) = m (1,2,4,7)

Q. What is multi-threaded unix kernel? Multi-threaded UNIX kernel: We know threads are light-weight processors demanding minimal state information comprising the processor stat

What is a shell? A shell is an interactive user interface to an operating system services that permits an user to enter commands as character strings or by a graphical user int

can i get the comparison of microprocessors architecture?

Based on your understanding of Unit 2, compile a set of five usability and/or user experience goals which you think will be useful in evaluating the two sites when gathering the in

Q. Programming with parallel virtual machine? The general method for writing a program with PVM is like this:  A user writes one or more sequential programs in C++, C or FOR

Explain Direct Memory Access. A modest enhances in hardware enables an IO device to transfer a block of information to or from memory without CPU intervention. This task needs

Q. (192.8)10 - (AE.E)16 = (X)8, Find value of x. Use 8's complement method. Q. Write first 10 numbers in the base 4. Q. Explain Error-Detection code & Error-correction code w

How to maintain lists? To return from a high list level to the next-lower level (SY-LSIND), the user chooses back on a secondary list.  The system then gives the currently dis