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
Data transmission: Most digital communication data is transmitted in a serial form, that is, only one bit at a time. Transmission of data in serial form means each bit is tran

Computerised Systems : You would have realized by now that computing systems are most useful for manipulating information. Any organisation and management of information basically

Electronic mail is another PC to PC and PC to mainframe data exchange. If you subscribe to an electronic mail service, it will enable your PC to gain access to a 'mailbox' on a ma

Question 1 Briefly explain principles of effective navigation Question 2 Explain the terms URI and URL. Why should you use Relative URI? Question 3 What are the di

Fundamentals of IT 1. How do you insert a symbol in a Word document? 2. Explain absolute cell addressing? 3. Discuss Custom List? 4. Explain applications of Multimedia

Cryptography, the study of secret writing, has been around for a very long time, from simplistic techniques to sophisticated mathematical techniques. No matter what the form howeve

These addressing modes are: With immediate addressing, no lookup of data is essentially required. The data is located in the operands of the instruction itself, not in a different

What is virtual memory? How address mapping is done in cache memory? Elaborate your answer with examples.

Processor: Processor plays major role in a computer. One should carefully decide about the type of processor and its speed before making a choice. Currently Core 2 Duo process

Because it is enormously low level, assembly language can be optimized enormously well. Therefore assembly language is used where the extreme performance is needed for applications