Solution for Assignment 1 – COSC 6368 – Artificial Intelligence Spring 2009
Problem 1:
A state in this problem can be defined as (X, Y)
X: water present in the 4 liter jug {0, 1, 2, 3, 4};
Y: water present in the 3 liter jug {0, 1, 2, 3};
Initial state and goal states:
INITIAL: (0, 0)
GOAL: (2, 0); (2, 1); (2, 2); (2, 3)
The possible operations:
1. The jug can be filled with water from the tap.
2. The jug can be drained.
3. Water can be poured from one to another jug.
Operator rules:
OPR1: If X < 4, fill X: (X, Y) (4, Y)
This operator is applied to fill the 4 liter jug completely with water. This applies only
when the 4 liter jug is not completely filled.
OPR2: If Y < 3, fill Y: (X, Y) (X, 3)
This operator is applied to fill the 3 liter jug completely with water. This applies only
when the 3 liter jug is not full with water.
OPR3: If X > 0, empty X: (X, Y) (0, Y)
This operator is applied to drain water from the 4 liter jug completely. This applies only
when the 4 liter jug has some water in it.
OPR4: If Y > 0, empty Y: (X, Y) (X, 0)
This operator is applied to drain water from the 3 liter jug completely. This applies only
when the 3 liter jug has some water in it.
OPR5: If (X+Y) >= 4 and Y > 0
This operator is applied to fill the 4 liter jug from the 3 liter jug
(X, Y) (4, Y – (4 – X))
