This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Improved Alpha-Beta Pruning of Heuristic Search in Game-Playing Tree
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
The game playing is an import domain of heuristic search, and its procedure is represented by a special and/or tree. Alpha-beta pruning is always used for problem solving by searching the game-playing-tree. In this paper, the plan which child nodes are inserted into game-playing-tree from large value of estimation function to small one when the node of no receiving fixed ply depth is expand is proposed based on alpha-beta pruning. It improves effect of search
Index Terms:
game playing, alpha-beta pruning, heuristic search
Citation:
Zhang-Congpin, Cui-Jinling, "Improved Alpha-Beta Pruning of Heuristic Search in Game-Playing Tree," csie, vol. 2, pp.672-674, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.