Completeness in search - artificial intelligence, Basic Computer Science

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.

 

Posted Date: 10/2/2012 2:02:47 AM | Location : United States







Related Discussions:- Completeness in search - artificial intelligence, Assignment Help, Ask Question on Completeness in search - artificial intelligence, Get Answer, Expert's Help, Completeness in search - artificial intelligence Discussions

Write discussion on Completeness in search - artificial intelligence
Your posts are moderated
Related Questions
Subroutine :   A subroutine  is a type of subprogram, a piece of code within a larger program that performs a specific task and is relatively independent of the remaining code.

ASCII code:  An alphanumeric code has to represent 10 decimal digits, 26 alphabets and certain other symbols such as punctuation marks and special characters. Therefore, a min

Data Base Software: Another major type of application comes under the heading database software; which allows for the collection of, searching for and manipulation of informat

Dear sir please define what is the difference between FAT 32 and NTFS .

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

Problem In the Excel sheet, input the marks of any 5 students with 5 subjects and find the average marks, maximum marks, minimum marks obtained by the student. Using Excel s

whats the out put of int main(){ int n=310; funcone(n); functwo(&n); cout return 0; } void funcone(intn) n=240; } void func two(intn*) { n=120; }

function of each status flags Z80 status flags

Modify the class declaration of the Employee class to specify that the Employee class is an abstract class Declare an abstract method called CalculateNetPay that returns a double v

WHAT DO MEAN BY ALGORITHM,HOW CAN ALGORITHM HELP TO WRITE BETTER COMPUTER PROGRAM ,WRITE AN ALGORITHM IN COMPUTER INTEREST