Approaches to AI 31
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.
- A
(Type: String) 140,100,0 String containing all of these (AND): 140, 100, 0
- B
(Type: String) 130,100,0 String containing all of these (AND): 130, 100, 0
- C
(Type: String) 140,120,0 String containing all of these (AND): 140, 120, 0
- D
(Type: String) 140,100,10 String containing all of these (AND): 140, 100, 10
