| 基于概率的剪枝算法 |
| |
| 引用本文： | 纪洪生.基于概率的剪枝算法[J].数字社区&智能家居,2006(11):99-100. |
| |
| 作者姓名： | 纪洪生 |
| |
| 作者单位： | [1]天津大学,天津300072 [2]辽宁省农业经济学校,辽宁锦州121001 |
| |
| 摘 要： | 以alpha—beta剪枝算法为研究对象，提出一种基于alpha—beta剪枝和概率剪枝因素相结合的概率剪枝算法．来解决博弈树搜索问题。利用概率剪枝算法，可减少博弈树搜索深度，从而加快搜索进程。
|
| 关 键 词： | alpha—beta剪枝 概率剪枝 博弈树 |
| 文章编号： | 1009-3044（2006）32-0099-02 |
| 收稿时间： | 2006-05-12 |
Pruning Algorithm Based on Probability |
| |
| JI Hong-sheng.Pruning Algorithm Based on Probability[J].Digital Community & Smart Home,2006(11):99-100. |
| |
| Authors: | JI Hong-sheng |
| |
| Abstract: | Regarding the alpha-beta pruning algorithm as studying object, probpruning algorithm composed of the alpha-beta pruning and probable factor was proposed for solving the searching question of game tree. Was used to decrease the search depth of game tree and thus enhance the rate of searching process. |
| |
| Keywords: | Alpha-beat Pruning Probpruning Game tree |
| 本文献已被 维普 等数据库收录！ |
