alphabeta剪枝算法在黑白棋应用中的优化.docVIP

alpha-beta剪枝算法在黑白棋应用中的优化 摘　要:alpha-beta剪枝算法是一种传统的搜索算法, 它在博弈算法中有着非常广泛的运用,它大大减少了相同搜索深度下的计算量,但其仍然不能满足有限时间内进行搜索的需求。为此,有很多针对该算法的优化方法,但这些优化方法大都是以消耗更多空间为代价的。本文以黑白棋为例,从全局考虑,提出几种优化策略,以较少的计算量,获得较高智能性。经过实验测试,在PC机中对相同的搜索层次,发现优化方法的算法可以较大幅度地提高效率. 关键词: alpha-beta剪枝算法,人工智能,黑白棋,算法优化 Abstract: alpha-beta algorithm is a kind of typical method for optimizing adversarial search, which is used widely in game playing algorithm for it reduces the computation amount obviously in the same search depth, but it still does not meet the requirement of searching in a limited time. So, there are many enhancements on its opt