AI Games Question:
Download Questions PDF

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

AI Games Interview Question
AI Games Interview Question

Answer:

c) Alpha-beta pruning
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can't influence the final decision.

Download AI Games Interview Questions And Answers PDF

Previous QuestionNext Question
Which values are independent in minimax search algorithm?
a) Pruned leaves x and y
b) Every state is dependent
c) Root is independent
d) None of the mentioned		General algorithm applied on game tree for making decision of win/lose is ____________
a) DFS/BFS Search Algorithms
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms