摘要
通过对博弈树搜索情形的深入分析,给出极小树叶结点数定理新的完整证明,指出以往证明源于对极小搜索树的认识偏差而不完备.对窗口搜索效率来源的细致分析和实验验证,则揭示出博弈树窗口搜索提高效率的首要原因是窗口位置而不是窗口大小.这一与人们的感性认知不符的定性结论,将有助于人们准确理解和运用有关博弈树搜索算法.
A concise proof for minimal game tree ＇s leaf node number theorem is presented according to some deficiencies in its pervious proofs, and also some misunderstandings of minimal game-tree are clarified. On the analyses and experiments of the efficiency source of the window searches, this paper reveals the fact that the improvement of the window searches efficiency results from the position of the window. This qualitative conclusion, which contains some inconsistencies from the common knowledge, gives accurate comprehension and utilization of window searches.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
2011年第4期521-526,共6页
Pattern Recognition and Artificial Intelligence
基金
国家自然科学基金项目(No.60775045
61033013)
苏州科技学院科研基金项目(No.xky201010)资助
