Artificial Intelligence - Approaches to Artificial Intelligence
37. When the algorithms MiniMax, AlphaBeta and SSS* search a game tree with k-ply lookahead
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
Consider the game tree in Figure 9.1. Each leaf is labeled with an integer that is the value returned by the evaluation function. In the subsequent questions, wherever there is more than one node that can be picked, we pick the leftmost node.
39. What is the value returned by a Minimax algorithm?
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
40. What is the sixth leaf node inspected by the AlphaBeta algorithm searching from left to right?
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.