Prune

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

• a) 10 states

• b) 8 States

• c) 6 States

• d) Any depth

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

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?

• Depth-first search

• Breadth-first search

• Alpha-beta pruning

• None of the mentioned

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

• Along the path of search

• Initial state itself

• At the end

• None of the mentioned

What is called as transposition table?

• Hash table of next seen positions

• Hash table of previously seen positions

• Next value in the search

• None of the mentioned

Which is identical to the closed list in Graph search?

• Hill climbing search algorithm

• Depth-first search

• Transposition table

• None of the mentioned

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

• Depends on the nodes

• Depends on the order in which they are executed

• All of the mentioned

• None of the mentioned

Which values are independent in minimax search algorithm?

• Pruned leaves x and y

• Every states are dependant

• Root is independant

• None of the mentioned

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

• Alpha = max

• Beta = min

• Beta = max

• Both Alpha = max & Beta = min

Which search is similar to minimax search?

• Hill-climbing search

• Depth-first search

• Breadth-first search

• All of the mentioned