In AO* algorithm, if n is an OR node with successor r1, r2, r3…….rp, then f(n) will be:

1
f(n) = min {f(r1)+ c(n, r1)}
2
f(n) = max {f(r1) + c(n, r1)}
3
f(n) = f(r1) + c(n, r1)
4
None of these
5
Question Not Attempted

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation