JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2009, Vol. 39 ›› Issue (6): 1-7.

• Articles •     Next Articles

A new search method for a game tree

  

  1.   ZHANG Ming-Liang:Electronics & Information College, Suzhou University of Science and Technology, Suzhou 215011, China;
     ZHANG Ming-Liang, LI Fan-Chang: College of Computer Science and Technology, Soochow University, Suzhou 215006, China
  • Received:2009-07-19 Online:2009-12-16 Published:2009-12-16

Abstract:

A new search method was given for a game-tree with breadth-firstin the first layer nodes and continuously minimal window test by deep analysis on game-tree search algorithms. It was good for the application and the processof search was easier for control, and may build a smaller search tree than the minimalgame-tree in theory. Comparison experiments indicate that the efficiency of thistechnique outperforms the PVS and MTD(f) method. Another speriority is tooptimize a game-tree by an iterative-deepening search, and to make the overall efficiency of iterative-deepening exceed a one-off game tree search.

Key words: game-tree;  minimal tree; null window search; iterative-deepening search; breadth-first; gobang

No related articles found!
Viewed
Full text
357
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 357

  From Others local
  Times 22 335
  Rate 6% 94%

Abstract
876
Just accepted Online first Issue
0 0 876
  From Others local
  Times 875 1
  Rate 100% 0%

Cited

Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!