UGC NET CSE | January 2017 | Part 3 | Question: 56

Question

Consider the following AO graph:

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

• A. A
• B. B
• C. C
• D. B and C

Comments

Option A is correct

Because

For A :  42+4 =46

For B and C :  meaning B and C connect with AND.

22+24+3+2=51

Min(46, 51 ) = 46

Answer 1

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