| 博弈树启发式搜索的α-β剪枝技术研究 |
| |
| 引用本文： | 张聪品,刘春红,徐久成.博弈树启发式搜索的α-β剪枝技术研究[J].计算机工程与应用,2008,44(16):54-55. |
| |
| 作者姓名： | 张聪品 刘春红 徐久成 |
| |
| 作者单位： | 河南师范大学,计算机与信息技术学院,智能信息处理实验室,河南,新乡,453007 |
| |
| 基金项目： | 河南省自然科学基金
,
河南省高等学校新世纪优秀人才支持计划 |
| |
| 摘 要： | 博弈是启发式搜索的一个重要应用领域,博弈的过程可以用一棵博弈搜索树表示,通过对博弈树进行搜索求取问题的解,搜索策略常采用α-β剪枝技术。在深入研究α-β剪枝技术的基础上,提出在扩展未达到规定深度节点时,对扩展出的子节点按照估价函数大小顺序插入到搜索树中,从而在α-β剪枝过程中剪掉更多的分枝,提高搜索效率。
|
| 关 键 词： | 博弈 启发式搜索 α-β剪枝 |
| 文章编号： | 1002-8331(2008)16-0054-02 |
| 收稿时间： | 2007-12-12 |
| 修稿时间： | 2007年12月12 |
Research on alpha-beta pruning of heuristic search in game-playing tree |
| |
| ZHANG Cong-pin,LIU Chun-hong,XU Jiu-cheng.Research on alpha-beta pruning of heuristic search in game-playing tree[J].Computer Engineering and Applications,2008,44(16):54-55. |
| |
| Authors: | ZHANG Cong-pin LIU Chun-hong XU Jiu-cheng |
| |
| Affiliation: | Key Laboratory for Intelligent Information Processing，College of Computer and Information Technology，Henan Normal University，Xinxiang，Henan 453007，China |
| |
| Abstract: | 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. |
| |
| Keywords: | game playing heuristic search alpha-beta pruning |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
