Branch-bound steepest ascent hill climbing means end constraint satisfaction - AI

Branch-bound steepest ascent hill climbing means end constraint satisfaction – AI

A – A-I, B-IV, C-III, D-II

B – A-I, B-II, C-III, D-IV

C – A-II, B-I, C-III, D-IV

D – A-II, B-IV, C-III, D-I

Show Answer With Best Explanation

Answer : A
Explanation:
Branch-and-bound  Keeps track of all partial paths which can be a candidate for further exploration.
Steepest-ascent hill climbing  Considers all moves from current state and selects the best move.
Constraint satisfaction  Discovers problem state(s) that satisfy a set of constraints.
Means-end-analysis  Detects difference between current state and goal state.