in Data Mining and Warehousing reopened by
5,207 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
in Data Mining and Warehousing reopened by
5.2k views

1 comment

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
0
0

1 Answer

3 votes
3 votes
Best answer

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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true