Uninformed search strategies, Basic Computer Science

Uninformed Search Strategies:

To be able to undertake a regular search, our entire agent ought to know is the starting state, the possible operators and how to check whether the goal has been reached. Once these have been described, we might then select a search method for the agent: a pre-defined way in which the operators will be applied.

The example we will use is the case of a genetics professor finding  for a name for her newborn  boy - of course, it might  only contain the letters D, A and N. The states in this search are strings of letters (but only Ds, As and Ns), and the starting  state is an empty string. Also, the operators available are: (i) add an 'N' to an existing string (ii) add a 'D' to an existing string and (iii) add an 'A' to an existing string. The goal check is feasible using a book of boy's names against which the professor may check a string of letters.

To help us think about the different kind of search method  , we use 2 analogies. Initially, we imagine that the professor keeps an agenda of actions to undertake, like wise : add an  'A'  to  the string  'AN'.  So, the agenda contain of pairs (O,S)  of states and operators, whereby the operator is to be applied to the state. At the top of the plan, the action is the one which is carried out, then that action is removed. How these actions are added to the plan differs for each search method. Next, we think of a search graphically: by making each state a node in a graph and every operator an edge, we might think of the search progressing as movement from node to node along edges in the graph. We then allow ourselves to talk about nodes in a search space (rather than the graph) and we say that a node in a search space has been expanded if the state that node represents has been visited and searched from. Notice that graphs which have no cycles in them are called trees and many Artificial Intelligence searches can be represented as trees.

Posted Date: 10/2/2012 2:06:33 AM | Location : United States







Related Discussions:- Uninformed search strategies, Assignment Help, Ask Question on Uninformed search strategies, Get Answer, Expert's Help, Uninformed search strategies Discussions

Write discussion on Uninformed search strategies
Your posts are moderated
Related Questions
wrap that computes a customer water bill. The bill include Rs.100 water demand charge + a consumption charge of Rs.1.5 for every thousand gallons used. Consumption is figured from

Reflex agent-Artificial Intelligence If an agent decides and executes an action in response to a sensor input without consultation of its world, then it may be considered a ref

Memory unit of computer: The Memory  unit is an important component of a computer where all the data and information are stored in the form  of binary digits (combination of 0

ENTERPRISE RESOURCE PLANNING What has football got to do with it? asks management guru Michael Hammer in his latest best seller Beyond Reengineering. The answer is almos

a program to create htmlpage

Question 1 Draw the block diagram of von Neumann Architecture and explain about its parts in brief Question 2 Draw the block diagram of Intel 8085 CPU organization and explai

Backup Storage: Back up (backing) storage, also termed external storage, is used to hold programs and data which are read into internal storage when required. The most common

WHAT IS CAI ITS PITFALLS

QUESTION (a) Distinguish between S-HTTP and SSL (b) What are the three basic security provided by SSL? (c) Discuss the limitations of SSL (d) State the port number us

Problem 1. Obtain the truth table and a Boolean expression for the following conditions: x is 0 if any two of the three variables are 1. x is 1 for all other conditions.