1) internal iterative deepening
内部迭代加深
1.
Based on characteristics of Chinese chess and the fact that algorithm efficiency is highly affected by move ordering,a move ordering scheme that achieved higher heuristic effect was designed,and proposed new algorithm internal iterative deepening with enlarged window,to revise move ordering scheme.
依据Alpha-Beta搜索算法的效率与子节点扩展的排列顺序高度相关的事实及中国象棋自身的特点,本研究从优化着法的排列顺序入手,设计出了启发能力较强的着法排列方案,并进一步提出了扩大窗口的内部迭代加深算法对上述着法排列方案进行修正,从而使着法顺序得到了进一步的优化。
2) Iterative deepening
迭代加深
3) Iterative Deepening A~* algorithm
迭代加深A~*
4) inner iteration
内部迭代
1.
Coupled task set solving method based on inner iteration;
基于内部迭代的耦合任务集求解方法
5) iterative deepening search
迭代加深搜索
1.
Based on the spanning tree algorithm and based on the iterative deepening search algorithm, has theoretically carried on the inferential reasoning, and unifies the actual example, has carried on the comparison to two algorithms, has obtained in certain situations, the latter algorithm search result is not too stable, preceding algorithm search result stable conclusion.
论述了控制网中最小独立闭合环搜索的两种算法:基于生成树的算法和基于迭代加深搜索的算法,在理论上进行了推导,并结合实际算例,对两种算法进行了比较,得出了在某些情况下,后一种算法搜索结果不是太稳定,前一种算法搜索结果稳定的结论。
6) iterative-deepening search
迭代深化
1.
Another speriority is to optimize a game-tree by an iterative-deepening search,and to make the overall efficiency of iterative-deepening exceed a one-off game tree search.
对比实验表明,该算法平均搜索效率高于PVS搜索和MTD(f)方法,并且使用该方法的迭代深化对博弈树优化效果最佳,从而使迭代深化搜索应用范围更加广泛。
补充资料：内部
内部
interior
囚都t加挽幻份;皿yT那二ocT‘J 拓扑空间X的子集A的满足下列条件的所有点x的集合:存在X中的开集U:，使x任U:CA.集合A的内部通常记为IntA，且表示含于A内的X中的最大开集.等式IntA=x\「X\A」成立，这里〔X}表示X的闭包.拓扑空间X中集合的内部是正则开(化孚血r open)集或典范集(。口训jCalset).其典范开集构成拓扑基(b朋e)的空间称为半正则的(~一记gu~lar).所有正则空间都是半正则的.内部有时也称为集合的开核(open ken祀1 of the set). B .H，floH咖apeB撰【补注1亦见集合的内部(泊忱由r of a set). 白苏华、胡师度译
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条