Consider the following statements related to π΄π‘π·βˆ’π‘‚π‘… Search algorithm. S1…

2018

Consider the following statements related toΒ π΄π‘π·βˆ’π‘‚π‘…Β Search algorithm.

S1 : A solution is a subtree that has a goal node at every leaf.

S2 : 𝑂𝑅 nodes are analogous to the branching in a deterministic environment.

S3 : 𝐴𝑁𝐷 nodes are analogous to the branching in a non-deterministic environment.

Which of the following is true referencing the above statements ?

Choose the correct answer from the code given below :

πΆπ‘œπ‘‘π‘’:

  1. A.

    𝑆1β€“πΉπ‘Žπ‘™π‘ π‘’,𝑆2β€“π‘‡π‘Ÿπ‘’π‘’,𝑆3β€“π‘‡π‘Ÿπ‘’π‘’

  2. B.

    𝑆1β€“π‘‡π‘Ÿπ‘’π‘’,𝑆2β€“π‘‡π‘Ÿπ‘’π‘’,𝑆3β€“πΉπ‘Žπ‘™π‘ π‘’

  3. C.

    𝑆1β€“π‘‡π‘Ÿπ‘’π‘’,𝑆2β€“π‘‡π‘Ÿπ‘’π‘’,𝑆3β€“π‘‡π‘Ÿπ‘’π‘’

  4. D.

    𝑆1β€“πΉπ‘Žπ‘™π‘ π‘’,𝑆2β€“π‘‡π‘Ÿπ‘’π‘’,𝑆3β€“πΉπ‘Žπ‘™π‘ π‘’

Attempted by 71 students.

Show answer & explanation

Correct answer: C

Short answer: All three statements are true. Explanation:

  • Statement 1 β€” A solution in AND-OR search is indeed a subtree in which every leaf is a goal node. For OR nodes the subtree picks one child that leads toward a solution, and for AND nodes the subtree includes all required children; in either case every leaf must be a goal for the subtree to be a valid solution.

  • Statement 2 β€” OR nodes correspond to deterministic branching: when the environment is deterministic, an agent chooses one action/branch and only that outcome occurs. OR nodes model the choice among alternative actions.

  • Statement 3 β€” AND nodes correspond to nondeterministic branching: an action may have multiple possible outcomes, and a solution must provide plans that handle every possible outcome. This is why an AND node requires all children to be solved.

Therefore, all three statements are true.

A video solution is available for this question β€” log in and enroll to watch it.

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…