博弈树启发搜索算法在五子棋游戏中的应用研究  

Research on the Application of Game-tree Search Algorithm in the Backgammon Game

作　　者：王建雄[1] 

机构地区：[1]赣南师范学院图书馆,江西赣州341000

出　　处：《科技情报开发与经济》2011年第29期138-140,147,共4页Sci-Tech Information Development & Economy

摘　　要：博弈是启发式搜索的一个重要应用领域,博弈的过程可以用一棵博弈搜索树表示,通过对博弈树进行搜索求取问题的解,搜索策略常采用α-β剪枝技术。在深入研究α-β剪枝技术的基础上,结合五子棋游戏特征,设计了五成/双三、估值函数和α-β剪枝算法相结合的改进博弈树搜索算法,实现了人机智能对弈的五子棋游戏。Game is an important application field of heuristic search,and the game process can be expressed by a game search tree.The solution of the problem can be found through searching the game tree,and α-β pruning technique is often used in the searching strategy.Based on in-depth study on α-β pruning technique and connecting with the features of backgammon game,this paper designs the improved game-tree search algorithm that combines five even/double three,the valuation function and α-β pruning algorithm,and achieves a human-machine intelligent chess game of backgammon.

关 键 词：博弈树 Α-Β剪枝 启发式搜索 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]