求论文摘要的英文翻译,谢谢

求论文摘要的英文翻译,谢谢
本文以计算机五子棋博弈系统作为课题,按照人工智能和计算机博弈的一般原理设计了一个五子棋博弈系统的基本模型,实现了基于博弈树分析的人机博弈.并且对五子棋博弈算法进行了一些有效的研究,分析了博弈树的极小极大搜索技术,以及在此基础上的Alpha-Beta剪枝过程和剪枝优化问题.此外还实现了Alpha-Beta剪枝的改进算法NegaScout算法,此算法首先采用一个有限的Alpha-Beta窗口,以确定实际估值的范围,再在这个较小的范围中搜索实际的估计值,由于在较小的范围中搜索,效率能得以提高.
本系统可采用多种算法实现博弈功能,包括极大极小算法、Alpha-Beta搜索、基于历史启发优化的Alpha-Beta搜索、基于置换表和历史启发增强的空窗探索（NegaScout）4种算法.程序同时可以调整博弈树的搜索深度,对算法的耗时和遍历的节点数进行统计,直观反应不同博弈算法间的差异.

In this paper, computer Gobang game system as a subject, in accordance with artificial intelligence and computer game design of the general principles of a Gobang game system's basic model, and based on the analysis of the plane tree Game Game. Gobang game and the algorithm a number of effective research, analysis of the game tree Minimax search technology, and on this basis, the Alpha-Beta pruning and pruning process optimization problem. It also has Alpha-Beta pruning to improve the algorithm NegaScout algorithm, the algorithm first to adopt a limited window of the Alpha-Beta, to determine the scope of the actual valuation, and then in this small area in search of the actual estimated value, because In the smaller scope of the search, efficiency can be improved.
The system can be a variety of algorithm Game features, including Minimax algorithm, Alpha-Beta search, based on historical inspiration optimize the Alpha-Beta search, based on the replacement table and history inspired to explore enhanced window (NegaScout) 4种Algorithm. Procedures at the same time can be adjusted Game tree depth of the search, the algorithm is time-consuming and nodes to Traversal statistics, intuitive reaction different game difference between the algorithm.