info@avatto.com
+91-9920808017
36. An evaluation function is needed in a game like Chess because
even though the game tree can be fully explored we can still harness human knowledge
the game tree is too big to be fully explored and we need to evaluate non-leaf nodes
to be able to generate an explanation for the move played by the computer
none of the above
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
37. When the algorithms MiniMax, AlphaBeta and SSS* search a game tree with k-ply lookahead
They compute the same minimax value
MiniMax computes a more accurate value because it searches the entire tree
SSS* computes more accurate values because it searches in a best first manner
AlphaBeta computes a more accurate value when searching right to left.
38. Let MM, AB and SSS be the number of nodes explored by the game playing algorithms MIN-MAX, alpha-beta and SSS* on a game tree. Which of the following inequalities are true?
MM ≥ AB ≥ SSS
MM ≤ AB ≤ SSS
MM = AB = SSS
MM ≥ AB = SSS
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?
57
55
56
53
40. What is the sixth leaf node inspected by the AlphaBeta algorithm searching from left to right?
50
40
60
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login