Subject
Computer Science
Topic
Artificial Intelligence
In a game tree, what does a MIN node try to do?
In a game tree, what does a MIN node try to do?
a)
Choose the move with the highest value for MAXb)
Stop the game immediatelyc)
Pick a move at randomd)
Choose the move with the lowest value for MAXExplanation
MIN represents the opponent, who tries to minimise MAX's score.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?