Artificial intelligence-specifying search problems, Basic Computer Science

Assignment Help:

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.

 


Related Discussions:- Artificial intelligence-specifying search problems

Briefly explain main parts of the camera, Question 1 Briefly explain main ...

Question 1 Briefly explain main parts of the Camera Question 2 Write a note on: Ripple Edit Tool, Rate Stretch Tool & Track Selection Tool Question 3 What is Pixel

Depth first search-artificial intelligence, Depth First Search-Artificial i...

Depth First Search-Artificial intelligence: Depth first search is  similar to breadth first, except that things are added to the top of the plan rather than the bottom. In our

OPERATING SYSEMS, Design an ER diagram for an IT training group. The compan...

Design an ER diagram for an IT training group. The company has 12 instructors and can handle upto 100 trainees for each training section. The company offers 5 advanced technology c

Example of autonomous rational agents, Example of autonomous rational agent...

Example of autonomous rational agents-Artificial intelligence The procedure of waste water treatment After the level of pollutants in waste water is find out,  following 5

How to crack a password, how can i crack the password of vmware virtual mac...

how can i crack the password of vmware virtual machine

Explain the process of fetching a word from the memory, Question 1 Explain...

Question 1 Explain the functional units of a basic computer with a neat diagram Question 2 Explain how you can get 1's complement of a given binary number? Also explain 1'

Super computers, Super Computers: The specialised demands and requirem...

Super Computers: The specialised demands and requirements of science, industry and military have led to the creation of powerful super computers. For numerically intensive com

C, Padovan sequence

Padovan sequence

Database assignment help , What îs exactly data type and Database Assignme...

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

Explain the raster scan display system, Question 1 Explain boundary fill a...

Question 1 Explain boundary fill and flood fill polygon filling algorithm Question 2 Draw and explain the block diagram of typical workstation Question 3 Explain the ras

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