ai unit1
ai unit1
Problem Characteristics
Heuristic search is a very general method applicable to a large class of problem.
In order to choose the most appropriate method (or combination of methods) for a
particular problem it is necessary to analyze the problem along several key
dimensions.
Is the problem decomposable into a set of independent smaller sub problems?
Decomposable problems can be solved by the divide-and- conquer technique.
Use of decomposing problems:
Each sub-problem is simpler to solve.
Each sub-problem can be handed over to a different processor. Thus can be
solved in parallel processing environment.
There are non decomposable problems.
For example, Block world problem is non decomposable.
1.Problem Solving
AI programs have a clean separation of
computational components of data,operations
& control.
Search forms the core of many intelligent
processes.
•
• R6: (X, Y | X+Y >= 3 L X > 0) à (X – (3 – Y), 3)
• {Pour water from 4-gallon jug into 3- gallon jug until 3-gallon
jug is full}
• R7: (X, Y | X+Y <= 4 L Y > 0) à (X+Y, 0)
• {Pour all water from 3-gallon jug into 4-gallon jug }
• R8: (X, Y | X+Y <= 3 L X > 0) à (0, X+Y)
• {Pour all water from 4-gallon jug into 3-gallon jug }
• Superficial Rules: {May not be used in this problem}
• R9: (X, Y | X > 0) à (X – D, Y)
•{Pour some water D out from 4-gallon jug} R10: (X, Y | Y > 0) à
(X, Y - D)
• {Pour some water D out from 3- gallon jug}
Trace of steps involved in solving the water jug problem - First solution
Trace of steps involved in solving the water jug problem - Second solution
Note that there may be more than one solutions.