Artificial intelligence-specifying search problems, Basic Computer Science

Specifying Search Problems


In our agent expressions, a problem to be solved is a specific task where the agent starts with the atmosphere in a given state and acts upon the environment pending the altered state has some programmed excellence. The set of states which are possible via some series of actions the agent takes is called the search space. The sequence of actions that the agent actually performs is its search path, and the last state is a solution if it has the necessary assets. There may be many solutions to a particular trouble. If you can think of the task you want your agent to do in these terms, then you will need to mark a problem solving agent which uses search.

It is important to recognize the scope of your task in conditions of the problems which will require to be solved. For instance, there are some errands which are solo problems solved by penetrating, e.g., find a route on a map. Alternatively, there are tasks such as charming at chess, which have to be out of order down into sub-problems (searching for the best move at each stage). Other tasks can be achieved without searching whatsoever e.g., multiplying two big numbers together - you wouldn't vision of searching through the figure line until you came crossways the answer!

There are three first considerations in problem solving (as described in Russell and Norvig):

  •  Initial State:Initially, the agent needs to be told precisely what the first state is before it starts its look for, so that it can keep path of the state as it searches.

 

  •  Operators:An operator is a function pleasing one state to another via an action undertaken by the agent. For example, in chess, an operator takes one understanding of pieces on the panel to another arrangement by the action of the agent moving a part.

 

  • Goal Test:It is necessary when design a problem solving agent to know when the trouble has been solved, i.e., to have a well definite goal test. Assume the problem we had set our agent was to find a name for a newborn baby, with several properties. In this container, there are lists of "accepted" names for babies, and any answer must come into view in that list, so goal-checking amounts to just testing whether the name appears in the list. In chess, on the other hand, the aim is to achieve a checkmate. While there are only a limited number of ways in which the pieces on a board can stand for a checkmate, the number of these is vast, so checking a place against them is a bad idea. Instead, a more abstract view of checkmate is second-hand, whereby our agent checks that the opponent's king cannot move with no being captured.

 

Posted Date: 8/20/2012 12:33:22 PM | Location : United States







Related Discussions:- Artificial intelligence-specifying search problems, Assignment Help, Ask Question on Artificial intelligence-specifying search problems, Get Answer, Expert's Help, Artificial intelligence-specifying search problems Discussions

Write discussion on Artificial intelligence-specifying search problems
Your posts are moderated
Related Questions
The primary step is to start the Debug; this step only consists of typing debug [Enter] on the operative system on time. the "a" (assemble) command is used To assemble a program on

Two dimensional Arrays:  A two-dimensional array is like a table, with a defined number of rows, where each row has a defined number of columns. In some instances we need to  hav

Time Sharing System: With the use multiprogramming, the batch processing can be quite  efficient. However, for many jobs, it is desirable to provide a mode in which the user i

SYMBOLS CHART Every one of the parts on code line in assembler is known as token, for instance on the code line: MOV AX, Var We comprise three tokens, the MOV instruction, the AX o

Ineed help to do my homework which is for designing of requirenments.

Question 1 Define the concept of equivalence relation. Give atleast two examples of equivalence relation Question 2 Prove that a graph G is connected if and only if it has a

what duality principle and huntington postulates

This is an article and I want great synopsis for the article

QUESTION (a) Given the graph as shown in figure, apply Lagrangian technique to complete the table assuming μ=1 and T=14                        Path P

Collaboration: Collaboration is defined as an act or process of working together on a project or some intellectual activity. But what is the importance of collaboration? The w