摘要
α-β剪枝算法是博弈树搜索算法中成熟而重要的一枝。本文给出其各种改进策略及实现技术,并给出实验结果分析。B*算法是α-β剪枝算法的挑战者,它给我们以新的视角看待博弈树搜索,并能克服α-β剪枝算法的一些缺陷。
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.
出处
《科技广场》
2007年第5期15-17,共3页
Science Mosaic
关键词
人工智能
博弈树搜索
α-β剪枝算法
B＊算法
Artificial Intelligence
Game-tree Search
Alpha-beta Pruning Algorithm
B＊ Algorithm
