Artificial Intelligence - Approaches to Artificial Intelligence

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Artificial Intelligence > > Approaches to Artificial Intelligence

46. What is the last leaf node inspected by the AlphaBeta algorithm searching from right to left?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


47. For the game tree in Figure above list the leaf nodes that form the initial clusters in the order inspected by the algorithm SSS*. At all times if there is a choice between more than one candidate node, always select the node on the left.

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


48. For the game tree in above Figure, list the leaf nodes till termination that are inspected after the initial clusters are formed in the order inspected by the algorithm SSS*. At all times if there is a choice between more than one candidate node, always select the node on the left.
1. 57,17,60,70,75,77,80
2. 57, 17, 60, 70, 75, 80
3. 57, 17, 60, 70, 75, 77, 80
4. 57, 17, 60, 70, 75, 80
5. 57, 17, 60, 70, 75, 77, 80, 88
6. 57, 17, 60, 70, 75, 80

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


49. On the basis of answers to the previous questions, which of the following statements are true?
1. AlphaBeta algorithm searching from left to right explored less number of leaf nodes as compared to AlphaBeta algorithm searching from right to left
2. AlphaBeta algorithm searching from left to right explored more number of leaf nodes as compared to AlphaBeta algorithm searching from right to left
3. AlphaBeta algorithm searching from left to right explored equal number of leaf nodes as compared to AlphaBeta algorithm searching from right to left
4. SSS* would explore more number of nodes as compared to the number of nodes it explored in the given game tree in the figure above, it the heuristic value 19th node from the left to changed from 60 to 15

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


50. Does the Hill Climbing algorithm find a path to the goal node in the previous question?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *