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
Writing Assignment 1: Your boss wants to know about the risks of corporate blogging and recommended policies to prevent companies from liability. Write a properly informal for

E-R diagram and details for college management system

Importance of Good Database Design Poor database design may have results in unwanted data redundancy Poor database design keeps errors leading to bad decisions and results Practica

WCDMA – FDD technology Multiple access technology is wideband CDMA (WCDMA) All cells at same carrier frequency Spreading codes used to separate cells and users Signal bandwidth 3.8

how we come to know about primary key,if more than ids gather?

What îs exactly data type and Database Assignment Help  ? We have can take several points of view, A data type îs set of values — char typically has 256 distinct values, into has

note on high level language and low level language

Goals of Autonomous Rational Agents: Artificial intelligence One possible way to improve an agent's performance is to enable it to have some kind of details about what it is tr

classify computer system according to capacity. how they are different from computer according to the classification of technology.provide the comparative study also.

Word Processing (WP): Word Processing is one of the most widespread application software types in use today. Developed as a successor to primitive text editors that were popul