阅读背景：

MTD(f) A Minimax Algorithm faster than NegaScout

来源：互联网 
Note that the MTD( f ) code calls an AlphaBeta version that stores its nodes in memory as it has determined their value, and retrieving their values in a re-search. If AlphaBeta wouldn't do that, then each pass of MTD() code calls an AlphaBeta ver

你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到：
你可能喜欢:
相关阅读:
随便看看: