Depth first search - artificial intelligence, Computer Engineering

Assignment Help:

Depth First Search - artificial intelligence:

Depth first search is very similar to breadth first, except for that the things are added to the top of this agenda rather than of the bottom. In our example we can notice, the first three things on the agenda would still be: 

Conversely, once the 'D' state has been found, the actions for this:  

1.(empty,add'D')

2.(empty,add'N')

3. (empty,add 'A')

They would be added to the top of the agenda for a certain reason, so it would look like this: 

4. ('D',add 'D')

5. ('D',add 'N')

6. ('D',add 'A')

 Obviously, carrying out this action at the top of the agenda and would introduce the string 'DD', but this would cause the action for: 

('DD',add 'D')

 Add to the top, and the next string found would be 'DDD'. Undoubtedly this can't go on indefinitely, and in the practice, we must have to specify a depth limit to stop for going down a particular path forever. Because is, our agent will need to record how far down a particular path it has been gone, and have to avoid putting actions on the agenda if there is the state in the agenda item that is past a certain depth.


Related Discussions:- Depth first search - artificial intelligence

Ecommerce concepts, Your task is to propose a business that has a Web ...

Your task is to propose a business that has a Web presence on the Internet. Your business may be an online only business or a so-called "clicks and mortar" business. You

Implement and - or- not gates using bit wise operator, Q. Develop  a menu d...

Q. Develop  a menu driven program to implement AND, OR, NOT gates using and without using  Bit wise operator. The menu  should  be  as follows: I.  Using Bit Wise operator I

Animation for project, Final Animation This is the final piece of work ...

Final Animation This is the final piece of work that should stand on its own as a piece of Art or Design. This is your personal response to the idea of Transformation - The pro

How are problems of clock skew minimized, How are problems of clock skew mi...

How are problems of clock skew minimized? Clock skew, when done right, can also benefit a circuit. This can be intentionally introduced to reduce the clock period, at that the

Explain about the acoustic tablet, Explain about the Acoustic tablet Ac...

Explain about the Acoustic tablet Acoustic (or sonic) tablet use sound waves to detect a stylus position. Either strip microphones or point microphones can be used to detect th

Where trunks lines are run between, Trunks are the lines that run between ...

Trunks are the lines that run between (A)  subscribers and exchange        (B) switching system and power plant (C)  Local Area Network                (D) switching syste

Dpsd -asynchronous circuits, an asyncronous sequential circuit is described...

an asyncronous sequential circuit is described by the the exitatio function and the output function y=x1x2''+(x1=x2'')y output function z=y a)draw the logic diagram of the circuit.

Explain bus interface unit, Q. Explain Bus Interface Unit? BIU (Bus Int...

Q. Explain Bus Interface Unit? BIU (Bus Interface Unit) mainly interacts with system bus. It executes nearly all the activities relating to fetch cycle like:  Computing

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

How many bits are required for a ladder d/a converter, How many bits are re...

How many bits are required at the input of a ladder D/A converter, if it is required to give a resolution of 5mV and if the full scale output is +5V. Find the %age resolution.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd