reopened by
6,202 views
0 votes
0 votes

Consider the following AO graph:

Which is the best node to expand by next AO* algorithm?

  1. A
  2. B
  3. C
  4. B and C
reopened by

1 Answer

Best answer
4 votes
4 votes

HERE f(n) for A node is less than from the value of f(n) for B and f(n) for C.So the best path will be G->A 

The best node is A

selected by
Answer:

Related questions

0 votes
0 votes
2 answers
2
0 votes
0 votes
3 answers
3
go_editor asked Mar 24, 2020
626 views
Match the following :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\\text{a.} & \text{Glass } & \text{i.} & \text{Contains liquid crystal and serves a...