Artificial Intelligence MCQ - Approaches to Artificial Intelligence

36 An evaluation function is needed in a game like Chess because

A
even though the game tree can be fully explored we can still harness human knowledge
B
the game tree is too big to be fully explored and we need to evaluate non-leaf nodes
C
to be able to generate an explanation for the move played by the computer
D
none of the above

View Explanation
Comment

Correct AnswerOption B

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Found this useful?

Follow:

Cancel reply

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

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

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

Comment *

Name

Save my name and email in this browser for the next time I comment.

37 When the algorithms MiniMax, AlphaBeta and SSS* search a game tree with k-ply lookahead

A
They compute the same minimax value
B
MiniMax computes a more accurate value because it searches the entire tree
C
SSS* computes more accurate values because it searches in a best first manner
D
AlphaBeta computes a more accurate value when searching right to left.

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

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

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

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

Comment *

Name

Save my name and email in this browser for the next time I comment.

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?

A
MM ≥ AB ≥ SSS
B
MM ≤ AB ≤ SSS
C
MM = AB = SSS
D
MM ≥ AB = SSS

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

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

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

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

Comment *

Name

Save my name and email in this browser for the next time I 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?

A
57
B
55
C
56
D
53

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

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

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

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

Comment *

Name

Save my name and email in this browser for the next time I comment.

40 What is the sixth leaf node inspected by the AlphaBeta algorithm searching from left to right?

A
50
B
40
C
55
D
60

View Explanation
Comment

Correct AnswerOption D

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Share this question

Cancel reply

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

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

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

Comment *

Name

Save my name and email in this browser for the next time I comment.

First Previous 6 7 8 9 10 Next Last