In a game-playing search tree, up to which depth can α–β pruning be applied?
(A) Root (0) level
(B) 6 level
(C) 8 level
(D) Depends on utility value in a breadth-first order
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (B) and (C) only
Explanation
Pruning cuts branches below the root and can be applied at any deeper level (such as 6 or 8). Nothing is pruned at the root itself, and α–β works depth-first, not breadth-first.More Artificial Intelligence (AI) questions
- Match List I with List II. Choose the correct answer from the options given below:List I List II A. Ontological engineering I. Organizing s…
- Given below are two statements: Statement I: "A grandparent is a parent of one's parent." Statement II: The first-order predicate logic (FO…
- Match List I with List II Choose the correct answer from the options given below:
- Consider the following table defining the sample inputs and corresponding target values for a perceptron model. What shall be the value of…
- Match List I with List II Choose the correct answer from the options given below:
- Which of the followings is not a valid property R˜ S ˜ over two fuzzy relations and which must be λ obeyed for performing -cut defuzzificat…