edited by
317 views
0 votes
0 votes

In a game playing search tree, upto which depth $\alpha-\beta$ pruning can be applied?

(A) Root $\text{(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 :

  1. $\text{(B)}$ and $\text{(C)}$ only
  2. $\text{(A)}$ and $\text{(B)}$ only
  3. $\text{(A)}$ $\text{(B)}$ and $\text{(C)}$ only
  4. $\text{(A)}$ and $\text{(D)}$ only
edited by

1 Answer

Related questions

1 votes
1 votes
0 answers
2
admin asked Oct 23, 2022
898 views
Using $\text{'RSA'}$ algorithm, if $p=13, q=5$ and $e=7$. the value of $d$ and cipher value of $'6'$ with $(e, n)$ key are$7, 4$$7, 1$$7, 46$$55,1$
0 votes
0 votes
1 answer
4
admin asked Oct 23, 2022
317 views
Size and complexity are a part ofPeople MetricsProject MetricsProcess MetricsProduct Metrics