Approaches to AI 32

Home
Approaches to AI 32

Figure 3.2 depicts a search space in which the nodes are labeled with uppercase alphabets: A,B,C,… . Here, node I is the start node and node X is the goal node. The nodes are laid out on a grid where each square is of size 10 x 10 units.
Pleae use the Manhattan Distance as the heuristic function for the following problems.

For the questions below please enter the answer as a sequence of nodes separated by a comma.

0. Starting at node I, list the order in which the Hill Climbing algorithm explores the graph till termination, use Manhattan Distance as the heuristic function.

A
(Type: String) I,P,Q
String containing all of these (AND): I, P, Q
B
(Type: String) I,Q,R
String containing all of these (AND): I, Q, R
C
(Type: String) I,R,S
String containing all of these (AND): I, R, S
D
(Type: String) I,P,Q,R
String containing all of these (AND): I, P, Q, R

Answer
Comment
Array

Option : A
Explanation :

Forgot your password?

I agree with the Terms.

Back to login