Subject
Computer Science
Topic
Artificial Intelligence
Which search is the minimax algorithm most similar to?
Which search is the minimax algorithm most similar to?
a)
Hill-climbing searchb)
Depth-first searchc)
Breadth-first searchd)
Best-first searchExplanation
Minimax explores the game tree depth-first, keeping only one path from the root in memory at a time.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?Two move orders examine the same fixed game tree with alpha-beta pruning. What remains unchanged?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?