Consider the following statements related to AND-OR Search algorithm. S1 : A solution is a subtree that has a goal node at every leaf. S2 : OR nodes are analogous to the branching in a deterministic environment S3 : AND nodes are analogous to the branching in a non-deterministic environment. Which one of the following is true referencing the above statements ? Choose the correct answer from the code given below:

S​1​: A solution is a subtree that has a goal node at every leaf.\r
S​2​: OR nodes are analogous to the branching in a deterministic environment\r
S​3: AND nodes are analogous to the branching in a non-deterministic environment.\r

Data Structures UGC

Question 1

Consider the following statements related to AND-OR Search algorithm.

S1 : A solution is a subtree that has a goal node at every leaf.
S2 : OR nodes are analogous to the branching in a deterministic environment
S3 : AND nodes are analogous to the branching in a non-deterministic environment.

Which one of the following is true referencing the above statements ? Choose the correct answer from the code given below:

Discuss it

There are 1 questions to complete.

Last Updated :

Take a part in the ongoing discussion