Adversarial Search Flashcards
(9 cards)
What is alpha-beta pruning?
A search algorithm that improves Minimax by skipping branches that cannot affect the final decision, reducing computation.
What is alpha (α) in alpha-beta pruning?
The best value that the MAX player can guarantee so far.
What is beta (β) in alpha-beta pruning?
The best value that the MIN player can guarantee so far.
What is the pruning condition at a MAX node?
If α ≥ β, prune the remaining children.
What is the pruning condition at a MIN node?
If α ≥ β, prune the remaining children.
What does it mean to “prune” a node?
Skip evaluating that branch because we already know it won’t affect the outcome.
In the context of alpha-beta pruning, when is a node pruned?
When the current branch can’t possibly produce a better result than one already found.
What is α start value?
α = -∞
What is β start value=
β =+∞
