摘要
以alpha—beta剪枝算法为研究对象,提出一种基于alpha—beta剪枝和概率剪枝因素相结合的概率剪枝算法.来解决博弈树搜索问题。利用概率剪枝算法,可减少博弈树搜索深度,从而加快搜索进程。
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.
出处
《电脑知识与技术》
2006年第11期99-100,共2页
Computer Knowledge and Technology