A proof for minimal game tree's leaf node number theorem

被引：0
|
作者：
Zhang, Ming-Liang [1 ,2 ]
Wu, Jun [1 ]
Li, Fan-Zhang [2 ]
机构：
[1] Electronics and Information College, Suzhou University of Science and Technology, Suzhou 215011, China
[2] College of Computer Science and Technology, Soochow University, Suzhou 215006, China
来源：
Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence | 2011年 / 24卷 / 04期
关键词：
Trees; (mathematics);
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：521 / 526
相关论文
共 50 条
12345