Scribd
Upload
9 views4 pages

Artificial Intelligence

Chapter-2

Uploaded by

Maa Nos Subedy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views4 pages

Artificial Intelligence

Chapter-2

Uploaded by

Maa Nos Subedy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Chapter – 2

Problem Solving
Introduction
Problem solving is a goal – based agent system that finds sequence of actions that lead to
desirable states from the initial state. The four steps of problems solving are:
I. Goal Formulation

Helps to organize behavior by isolating and representing the task knowledge necessary to solve
problem.
II. Problem Formulation
Define the problem precisely with initial states, final state and acceptable solutions.
III. Searching
Find the most appropriate techniques of sequence among all possible techniques.
IV. Execution

Once the search algorithm returns a solution to the problem, the solution is then executed by
the agent.

State Space Representation

A state space essentially consists of a set of nodes representing each state of the problem, arcs
between nodes representing the legal moves form one state to another, an initial state and a
goal state.

A problem is defined as well - defined problem if the problem is composed of initial state,
actions (using successor function),goal test (to determine the goal state ) and path cost. The
actions and rules should be defined in as general way as possible. If the specific rules are made,
the rule set becomes very large.
E.g Chess world
Let the current position of horse: (4,4)
From rules of chess of the position (2,3), (2,5), (3,2),(3,6), (5,2), (5,6), (6,3) and (6,5).
Current position of the horse can be any other location we have to define another rule to find
next possible position. By doing so, the rule set becomes very large. Therefore, specific pattern
should be described for each object / item of the game. For above case, for moving a horse,
next possible position is current position +-/- (( 2 vertical + 1 horizontal) or (1 vertical + 2
horizontal)) position.
When a problem is defined with all its states, it is said to be a complete state space.

Problem Classification
Ignorable
Intermediate actions can be ignored. E.g Water jug problem.
Recoverable
The actions can be implemented to go the initial state E.g 8 – puzzle game
Irrecoverable
The actions cannot help to reach the precious state. E.g tic – tac – toe
Decomposable: the problem can be broken into similar once. E.g word puzzle game

Example: Measuring problem


Solve the given crypt – arithmetic problem
WRONG + WRONG = RIGHT
RIGHT + RIGHT = WRONG
BASE + BALL = GAMES

You might also like