... >>最大最小搜索算法(Max-min search algorithm) >>剪枝搜索算法(Alpha-beta search algorithm) >神经网络（Artificial Neural Networks） ...
基于2个网页-相关网页
此外，程序员们也提出了很多算法和技巧来减少节点数目，比如阿尔法 贝塔剪枝算法（Alpha-Beta pruning），Negascout搜索算法以及MTD（全称是：Memory enhanced Test Driver，即记忆增强测试驱动，译者注）方法。
In addition, programmers have come up with all sorts of algorithms and tricks such as Alpha-Beta pruning, Negascout, and MTD(f) in order to lessen the number of nodes the computer must examine.
针对运动图上的路径搜索，提出了基于路径曲线所夹面积的目标函数并改进了分段搜索算法和剪枝策略。
Concerning path search in the motion graph, this paper used the area between two curves as the target function and improved the strategy of incremental search and the strategy of branch and bound.
应用推荐