List i
|
List ii.
|
A. Steepest
Ascent hill climbing.
|
1. Keeps
track of all partial paths, which can be candidate for further exploration.
|
B. Branch
and bound
|
2. Discover
problem state that satisfy a set of constraints.
|
C. Constraint
satisfaction
|
3. Detect
difference between current state and goal state.
|
D. Means
end analysis
|
4. Consider
all moves from the current state and selects best moves.
|
Codes.
A B C D
a)
I iv iii ii
b)
Iv I ii iii
c)
I iv ii iii
d)
Iv ii I iii.
Answer B.
This comment has been removed by the author.
ReplyDelete