博弈树搜索算法研究

Research on algorithm of game playing tree searching

通过讨论人工智能中用于计算机博奕的一般技术如极大极小搜索、Alpha-Beta剪枝、小窗口搜索,对五子棋博奕的内在规律进行了分析研究,给出解决五子棋博奕的2种优化算法,这2种优化算法大大提高了搜索效率,相比之下引入置换表后的优化算法的搜索效率更高。

The paper introduces many algorithms to improve the effect of Game Playing Tree searching,max-mini search,Alpha-Beta search and minimal window search.Some methods have been researched to modify the algorithm.A better algorithm will be designed to improve the efficiency of searching.