0 votes 0 votes Consider the following AO graph: Which is the best node to expand by next AO* algorithm? A B C B and C Data Mining and Warehousing ugcnetcse-jan2017-paper3 non-gate + – go_editor asked Feb 1, 2017 • reopened Jun 25, 2022 by Lakshman Bhaiya go_editor 6.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply Hradesh patel commented Mar 31, 2020 reply Follow Share 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 1 votes 1 votes Please log in or register to add a comment.
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 abirsince92 answered Sep 28, 2017 • selected Jun 25, 2018 by Sanjay Sharma abirsince92 comment Share Follow See all 0 reply Please log in or register to add a comment.