博弈树启发式搜索的α-β剪枝技术研究  

Research on alpha-beta pruning of heuristic search in game-playing tree

作　　者：张聪品[1] 刘春红[1] 徐久成 

机构地区：[1]河南师范大学计算机与信息技术学院智能信息处理实验室,河南新乡453007

出　　处：《计算机工程与应用》2008年第16期54-55,97,共3页Computer Engineering and Applications

基　　金：河南省自然科学基金(the Natural Science Foundation of Henan Province of China under Grant No.0511012500);河南省高校新世纪优秀人才支持计划(the New Century Excellent Talent Foundation of Henan Province of China)

摘　　要：博弈是启发式搜索的一个重要应用领域,博弈的过程可以用一棵博弈搜索树表示,通过对博弈树进行搜索求取问题的解,搜索策略常采用α-β剪枝技术。在深入研究α-β剪枝技术的基础上,提出在扩展未达到规定深度节点时,对扩展出的子节点按照估价函数大小顺序插入到搜索树中,从而在α-β剪枝过程中剪掉更多的分枝,提高搜索效率。The game playing is an important 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 expanded is proposed based on alpha-beta pruning.It improves the effect of search.

关 键 词：博弈 启发式搜索α-β剪枝 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]