模式识别与人工智能
Thursday, Jul. 31, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2011, Vol. 24 Issue (4): 521-526    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
A Proof for Minimal Game Trees Leaf Node Number Theorem
ZHANG Ming-Liang1,2, WU Jun1, LI Fan-Zhang2
1.Electronics Information College,Suzhou University of Science and Technology,Suzhou,215011
2.College of Computer Science and Technology,Soochow University,Suzhou,215006

Download: PDF (466 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A concise proof for minimal game trees 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.
Key wordsMinimal Game Tree      Alpha-Beta Pruning      MTD(f)      Null Window Search     
Received: 12 April 2010     
ZTFLH: TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
ZHANG Ming-Liang
WU Jun
LI Fan-Zhang
Cite this article:   
ZHANG Ming-Liang,WU Jun,LI Fan-Zhang. A Proof for Minimal Game Trees Leaf Node Number Theorem[J]. , 2011, 24(4): 521-526.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2011/V24/I4/521
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn