Artificial-Intelligence
December 3, 2023Question 4189 – 2007 June UGC NET Paper 1
December 3, 2023Artificial-Intelligence
|
Question 9
|
Consider the following AO graph:
Which is the best node to expand next by AO* algorithm?
Which is the best node to expand next by AO* algorithm?
|
A
|
|
|
B
|
|
|
C
|
|
|
B and C
|
Question 9 Explanation:
f(n)=c(n)+h(n)
where
f(n)= Best path to reach the destination node
c(n)=Cost of path
h(n)= heuristic value of a node
Cost of choosing B or C is
=(22+3)+(24+2)
=51
Note: We add cost of B and C because they belongs to AND graph.
Cost of choosing A =42+4=46
Since cost of choosing node choosing B or C that’s why we will expand ‘A’.
Correct Answer: A
Question 9 Explanation:
f(n)=c(n)+h(n)
where
f(n)= Best path to reach the destination node
c(n)=Cost of path
h(n)= heuristic value of a node
Cost of choosing B or C is
=(22+3)+(24+2)
=51
Note: We add cost of B and C because they belongs to AND graph.
Cost of choosing A =42+4=46
Since cost of choosing node choosing B or C that’s why we will expand ‘A’.