Uninformed search strategies, Basic Computer Science

Assignment Help:

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.


Related Discussions:- Uninformed search strategies

Programming Project 1, Programming Project You will implement 2 algorithms...

Programming Project You will implement 2 algorithms to solve the single source shortest paths problem, Bellman-Ford Algorithm and Dijkstra''s algorithm Allowed programming languag

On-line and realtime systems, On-line and Realtime Systems An on-line s...

On-line and Realtime Systems An on-line system means that input and output devices are directly connected to the CPU irrespective of geographical location. Thus the user can di

Html, a program to create htmlpage

a program to create htmlpage

Problem - programming language, Problem - programming language: A Prob...

Problem - programming language: A Problem is to carry out a particular task. For solving the problem, some input has to be given to the system. The system will process or mani

Configuration of a pc, Configuration of a PC: Generally, when you thin...

Configuration of a PC: Generally, when you think of purchasing a Computer, you first try to exactly know what will be the hardware components such as processor, memory etc. of

Pipelining concept, The easiest way to approach pipelining is to regard as...

The easiest way to approach pipelining is to regard as the three stage fetch, decode and execute instruction execution cycle outlined earlier. There are times during each of these

Assignment, Assignment of computer science

Assignment of computer science

Syntax of a Procedure in assembly language, There are two kinds of procedur...

There are two kinds of procedures, the intrasegments, which are found on the similar segment of instructions and the inter-segments which can be stored on dissimilar memory segment

Omputer applications 2, true or false-- most designs of a desktop publishin...

true or false-- most designs of a desktop publishing document needs to follow clear, specific rules pertaining to design

Explain the concept of knowledge discovery in database, Question 1 Explain...

Question 1 Explain the concept of knowledge discovery in database Question 2 Discuss the following types of Multidimensional Data Models                    Stars, Snowflakes and

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