3c Problem Solving
3c Problem Solving
Introduction
Search is a method that can be used by computers to examine a problem space like
this in order to find a goal. Often, we want to find the goal as quickly as possible or
without using too many resources.
It has already become clear that many of the tasks underlying AI can be
phrased in terms of a search for the solution to the problem at hand.
Many goal based agents are essentially problem solving agents which must
decide what to do by searching for a sequence of actions that lead to their
solutions.
For production systems, we have seen the need to search for a sequence of
rule applications that lead to the required fact or action.
For neural network systems, we need to search for the set of connection
weights that will result in the required input to output mapping
Which search algorithm one should use will generally depend on the problem
domain? There are four important factors to consider:
3. Isolate and represent the task knowledge that is necessary to solve the problem
4. Choose the best problem-solving techniques and apply it to the particular problem
The state space representation forms the basis of most of the AI methods.
Formulate a problem as a state space search by showing the legal problem states, the legal
operators, and the initial and goal states.
A state is defined by the specification of the values of all attributes of interest in the world
An operator changes one state into the other; it has a precondition which is the value of certain
attributes prior to the application of the operator, and a set of effects, which are the attributes
altered by the operator
The initial state is where you start
The goal state is the partial description of the solution