| 博弈树搜索算法的分析与实现 |
| |
| 引用本文： | 危春波,王海瑞,文乔农.博弈树搜索算法的分析与实现[J].科技广场,2007,6(5):15-17. |
| |
| 作者姓名： | 危春波 王海瑞 文乔农 |
| |
| 作者单位： | 昆明理工大学信息工程与自动化学院,昆明,650051 |
| |
| 摘 要： | α-β剪枝算法是博弈树搜索算法中成熟而重要的一枝。本文给出其各种改进策略及实现技术,并给出实验结果分析。B*算法是α-β剪枝算法的挑战者,它给我们以新的视角看待博弈树搜索,并能克服α-β剪枝算法的一些缺陷。
|
| 关 键 词： | 人工智能 博弈树搜索 α-β剪枝算法 B*算法 |
| 文章编号： | 1671-4792-（2007）5-0037-03 |
Research on Game-tree Search Algorithm |
| |
| Wei Chunbo,Wang Hairui,Wen Qiaonong.Research on Game-tree Search Algorithm[J].Science Mosaic,2007,6(5):15-17. |
| |
| Authors: | Wei Chunbo Wang Hairui Wen Qiaonong |
| |
| Institution: | Faculty of Engineering and Automation;Kunming University of Science and Technology;Kunming 650051 |
| |
| Abstract: | The alpha-beta pruning algorithm is one of the most important and mature game-tree search algorithm. we give its improved strategy and implemental technology, furthermore we present experiment result and analysis. B* algorithm is a relative new method which is different from alpha-beta pruning algorithm, and it try to overcome the limitations of alpha-beta. |
| |
| Keywords: | Artificial Intelligence Game-tree Search Alpha-beta Pruning Algorithm B* Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
