other games such as Nine Men’s Morris) there are b available moves in the initial
empty game state, and each move takes away a potential move from the opponent. If
the ply depth is d, the number of game states checked for tic-tac-toe is
∑
i=1
d
b!
b −i!
where b! is the factorial of b. To give an example of the scale involved, Minimax
evaluates 187,300 states when b = 10 and d = 6.
During the recursive invocation within Minimax, the
score(state, player) evalua‐
tion function must be consistently applied using the original playerfor whom a
move is being ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.