Completeness in search - artificial intelligence, Basic Computer Science

Assignment Help:

Completeness in search - artificial intelligence:

It's also importance trying to calculate the number of solutions to a problem, and the density of those solutions amongst the non solutions. In a search problem, there can be any number of solutions, and the problem specification can involve, finding some, finding just one or finding all the solutions. For example, imagine a military application searches for routes that an opponent might take. The question: "Can the opponent get from A to B" requires searching only one solution, whereas the question: "How many ways can the opponent get from A to B" will require the agent to find all the solutions.

When an agent is asked to search just one solution, we can frequently program it to prune its search space quite heavily, for example, govern out particular operators at particular times to be more efficient. However, this can also prune some of the solutions, so if our agent is asked to search all of them, the pruning has to be controlled so that we know that  pruned  areas  of  the  search  space  e  contain  no  solutions or  contain solutions which are repeated in another (non-pruned) part of the space.

If our search method is guaranteed to search all the solutions eventually, then we say that it is complete. Repeatedly, it is clear that all the solutions are in the search space, but in other cases, we have to prove this fact mathematically to be confident that our space is complete. A  complete  search problem is that - where the solution is

Surely it can take much time to find the solution, sometimes so long that the strategy is effectively useless. Some of the people use the word exhaustive when they describe complete searches, because the strategy exhausts  whole possibilities in the search space.

 


Related Discussions:- Completeness in search - artificial intelligence

Cp, I NEED FLOW CHART ANT DRAWINGS OF BASIC OPERATIONS OF COMPUTER

I NEED FLOW CHART ANT DRAWINGS OF BASIC OPERATIONS OF COMPUTER

Explain the probability and non-probability sampling methods, Question 1 W...

Question 1 Write a program to read four floating point numbers and find their sum and average. Question 2 Differentiate string constants and character constants with one exam

Second generation of computers, THE SECOND GENERATION (1956-1965) ...

THE SECOND GENERATION (1956-1965) This generation of computers were characterized by:     Considerable reduction in physical size     Increased reliability

10, constant key use for in calculator

constant key use for in calculator

Ip basics, IP provide connectionless service to upper layer IP protocol is ...

IP provide connectionless service to upper layer IP protocol is very simple could not guarantee the reliability of transportations IP protocol is Point to Point IP provide the unif

Outdoor patient department features - receptionist module, Outdoor Patient...

Outdoor Patient Department (OPD) Features The following modules can be developed for various areas and workers. A receptionist Module Receptionist updates all bas

Define segments in assembly process?, The architecture of the x86 processor...

The architecture of the x86 processors forces with the use of memory segments to direct the information, the size of these segments is of 64kb. The cause of being of these segments

Advantages of computerized record-keeping, Advantages of Computerized Reco...

Advantages of Computerized Record-keeping Less manpower is required for upkeep.  Recording, storing, and retrieving are all much faster: easier and with little practice

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