Artificial Intelligence (2180703) MCQs

MCQs of Game Playing: Overview, And Example Domain

Showing 11 to 20 out of 41 Questions
1 2 3 4 5
11.
What are taken into account of state-space search?
(a) Postconditions
(b) Preconditions
(c) Effects
(d) Both Preconditions & Effects
Answer:

Option (d)

12.
Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
(a) Depth-first search
(b) Breadth-first search
(c) Alpha-beta pruning
(d) None of the mentioned
Answer:

Option (c)

13.
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
Answer:

Option (a)

14.
To which depth does the alpha-beta pruning can be applied?
(a) 10 states
(b) 8 States
(c) 6 States
(d) Any depth
Answer:

Option (d)

15.
Which search is similar to minimax search?
(a) Hill-climbing search
(b) Depth-first search
(c) Breadth-first search
(d) All of the mentioned
Answer:

Option (b)

16.
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
Answer:

Option (d)

17.
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
Answer:

Option (a)

18.
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
Answer:

Option (a)

19.
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
Answer:

Option (b)

20.
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
Answer:

Option (c)

Showing 11 to 20 out of 41 Questions
1 2 3 4 5