Skip to Main Content
算法技术手册(原书第2 版)
book

算法技术手册(原书第2 版)

by George T.Heineman, Gary Pollice, Stanley Selkow
August 2017
Intermediate to advanced content levelIntermediate to advanced
360 pages
8h 35m
Chinese
China Machine Press
Content preview from 算法技术手册(原书第2 版)
168
7
7-3Minimax 示例博弈树
博弈树的规模由每个棋局状态的可行走法决定。假设有
b
个可行走法,如果追寻深度为
d
那么对于字棋(或者九子直棋)来说,需要检查的游戏状态总数为
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 player for 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.
Start your free trial

You might also like

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

机器学习实战:基于Scikit-Learn、Keras 和TensorFlow (原书第2 版)

Aurélien Géron
Go语言编程

Go语言编程

威廉·肯尼迪
C++语言导学(原书第2版)

C++语言导学(原书第2版)

本贾尼 斯特劳斯特鲁普

Publisher Resources

ISBN: 9787111562221