...
Question 6729 – Artificial-Intelligence
December 3, 2023
Question 4189 – 2007 June UGC NET Paper 1
December 3, 2023
Question 6729 – Artificial-Intelligence
December 3, 2023
Question 4189 – 2007 June UGC NET Paper 1
December 3, 2023

Question 6714 – Artificial-Intelligence

Consider the following AO graph:

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

Correct Answer: A

Question 71 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’.
A
A
B
B
C
C
D
B and C
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!