11. | Where does the values of alpha-beta search get updated? |
Answer: (a).Along the path of search
|
12. | Which value is assigned to alpha and beta in the alpha-beta pruning? |
Answer: (d).Both a & b
|
13. | To which depth does the alpha-beta pruning can be applied? |
Answer: (d).Any depth
|
14. | Which values are independent in minimax search algorithm? |
Answer: (a).Pruned leaves x and y
|
15. | Which is the most straightforward approach for planning algorithm? |
Answer: (b).State-space search
|
16. | What are conditions taken into account of state-space search? |
Answer: (d).Both b & c
|
17. | How many ways are available to solve the state-space search? |
Answer: (b).2
|
18. | What is the other name for forward state-space search? |
Answer: (a).Progression planning
|
19. | What is the main advantage of backward state-space search? |
Answer: (c).Relevant actions
|
20. | What is the other name of backward state-space search? |
Answer: (a).Regression planning
|