WBCHSE Applied AI Practice Questions - West Bengal Higher Secondary Applied Artificial Intelligence Exam

In the Minimax algorithm for adversarial game playing, what does Alpha-Beta pruning achieve?

It changes the final optimal move evaluation compared to standard Minimax. It eliminates branches in the search tree that cannot possibly influence the final decision. It converts two-player zero-sum games into multi-agent cooperative games. It guarantees polynomial time complexity for NP-hard game trees.

Correct Answer:

It eliminates branches in the search tree that cannot possibly influence the final decision.

Access more questions from this quiz

Continue to WBCHSE Applied AI Practice Questions - West Bengal Higher Secondary Applied Artificial Intelligence Exam for more practice questions and the full quiz experience.

Access More Questions