2.classic AI Problems
2.classic AI Problems
Classic AI Problems:
Vacuum cleaner problem
Water Jug problem
The Farmer ,Wolf ,Goat,and Cabbage Problem
8 puzzle problem
A travelling salesman problem
Tower of Hanoi
Monkeys and bananas
Chess etc
Vacuum Cleaner Problem
Problem Statement:
This particular world has just two locations:
Squares A
Square B.
The vacuum agent perceives which square it is in and
whether there is dirt in the square.
It can choose to
move left,
move right,
suck up the dirt,
Do nothing.
Possible Actions:
One very simple agent function is the
following:
if the current square is dirty, then suck,
otherwise move to the other square.
Problem Formulation:
States:
The agent is in one of two locations, each of which might or might
not contain dirt.
Thus there are 2 x 22 = 8 possible world states.
Initial state:
Any state can be designated as the initial state.
Successor function:
This generates the legal states that result from trying the three
actions (Left, Right, and Suck).
Problem Formulation:
Goal test:
This checks whether all the squares are clean.
Path cost:
Each step costs 1, so the path cost is the
number of steps in the path.
Vacuum Agent Function
Vacuum World State Space Graph:
WATER JUG PROBLEM
Problem Statement:
We are given 2 jugs, a 4 liter one and a 3-
liter one. Neither has any measuring markers
on it.
There is a pump that can be used to fill the
jugs with water.
How can we get exactly 2 liters of water in to
the 4-liter jugs?
Problem Formulation:
The state space for this problem can be defined as
{ ( i ,j ) i = 0,1,2,3,4 j = 0,1,2,3}
Solution 1
Solution 2
Solution 3
Analysis of Solution:
We see that, when there is no limit for water
prevails then solution is the most efficient.
When water is limited then Solution 2 is the
best suited.
In no way solution 3 is good, Because it
requires 8 steps for solution and wastes 5
liters of water.