Consider the following three variants of minimax: the simple version, alpha-beta

Question

Consider the following three variants of minimax: the simple version, alpha-beta search, and depth-limited search, and consider the games of tic-tac-toe and chess. For each combination of minimax variant and game, answer the following question: can that minimax variant possibly never terminate, in computing the best next move? Justify your answer. For chess, assume that the rules do not impose any limit on the total number of moves in a game.

Explanation / Answer

fun minimax(n: node): int = if leaf(n) then return evaluate(n) if n is a max node v := L for each child of n v' := minimax (child) if v' > v, v:= v' return v if n is a min node v := W for each child of n v' := minimax (child) if v'

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---