Adversarial Search Questions

MCQ bookmark_border

21.

Which search is equal to minimax search but eliminates the branches that can

A

Depth-first search

B

Breadth-first search

C

Alpha-beta pruning

D

None of the mentioned

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

22.

Which values are independant in minimax search algorithm?

A

Pruned leaves x and y

B

Every states are dependant

C

Root is independant

D

None of the mentioned

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

23.

To which depth does the alpha-beta pruning can be applied?

A

10 states

B

8 States

C

6 States

D

Any depth

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

24.

Which search is similar to minimax search?

A

Hill-climbing search

B

Depth-first search

C

Breadth-first search

D

All of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

25.

Which value is assigned to alpha and beta in the alpha-beta pruning?

A

Alpha = max

B

Beta = min

C

Beta = max

D

Both Alpha = max & Beta = min

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

26.

Where does the values of alpha-beta search get updated?

A

Along the path of search

B

Initial state itself

C

At the end

D

None of the mentioned

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

27.

How the effectiveness of the alpha-beta pruning gets increased?

A

Depends on the nodes

B

Depends on the order in which they are executed

C

All of the mentioned

D

None of the mentioned

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

28.

What is called as transposition table?

A

Hash table of next seen positions

B

Hash table of previously seen positions

C

Next value in the search

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

29.

Which is identical to the closed list in Graph search?

A

Hill climbing search algorithm

B

Depth-first search

C

Transposition table

D

None of the mentioned

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

30.

Which function is used to calculate the feasibility of whole game tree?

A

Evaluation function

B

Transposition

C

Alpha-beta pruning

D

All of the mentioned

Correct Answer: A

Check Answer report_problem Report forum Discussion