Subject
Computer Science
Topic
Artificial Intelligence
Two move orders examine the same fixed game tree with alpha-beta pruning. What remains unchanged?
Two move orders examine the same fixed game tree with alpha-beta pruning. What remains unchanged?
a)
The minimax resultb)
The number of expanded nodesc)
The first leaf visitedd)
The pruning locationsExplanation
Move ordering changes efficiency, but correct alpha-beta pruning returns the same minimax value.Related questions
In the figure, a complete binary game tree lists terminal values left-to-right as 3,12,8,2,4,6,14,5. If the root is MAX, what is its minimax value?During alpha-beta search, a MIN node obtains a value no greater than current alpha. What is safe?Which ordering usually improves alpha-beta pruning?With left-to-right alpha-beta search on a full binary tree whose leaves are 8,7,6,5,1,2,3,4, how many leaf evaluations are pruned?With left-to-right alpha-beta search on a full binary tree whose leaves are 4,3,2,1,8,7,6,5, how many leaf evaluations are pruned?A game contains chance events such as dice rolls. Which extension of minimax is appropriate?To which depth can alpha-beta pruning be applied?Which search is the minimax algorithm most similar to?