The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 672-674
ABSTRACT
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", Computer Science and Information Engineering, World Congress on, vol. 02, no. , pp. 672-674, 2009, doi:10.1109/CSIE.2009.527
98 ms
(Ver 3.1 (10032016))