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.
解析看不懂？求助智能家教解答查看解答
2074
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
