基于西洋跳棋的博弈程序研究.pdfVIP

第21 卷第3 期 Vol. 21 No.3 哈尔滨理工大学学报 JOURNAL OF HARBIN UNIVERSITY OF SCIENCE AND TECHNOLOGY 2016 年6 月 Jun. 2016 基于西洋跳棋的博弈程序研究 郑昌松，贾丽娟，权贺，王彪 (哈尔摸理工大学自动化学院，黑龙江哈尔滨 15∞80) 摘 要:为了提高计算机博弈水平，以西洋跳棋为研究对象设计博弈程序.采用 Min-Max 搜索 算法实现对博弈树的搜索，根据α-ß 剪枝算法研究博弈树的估值深度，设计了搜索深度可以剪枝的 博弈模型.该博弈模型解决了博弈程序布局方式、估值深度和搜索耗时等问题，提高了程序搜索效 率和博非性能.博弈程序在全国大学生博弈比赛中获得二等奖，在实际中得到了检验和应用，比赛 结果表明了该博弈模型是可行和有效的. 关键词:计算机博弈;深度;搜索;布局;博弈树 DOI: 10. 15938/j.jhus t. 2016. 03. ∞5 中固分类号:TP311 文献标志码:A 文章编号: 1∞7 - 2683 (2016 )03-∞24-05 Programming Research Based on Game of Checkers ZHENG Chang-song , JIA Li-juan , QUAN He , WANG Biao (School of Computer Science and Technology. H缸也in University of Science 皿d Technology. Hm也in 15∞80 ， China) Abstract : In order to improve the level of 由e computer game , we designed a game program based on the re- search of checkers. In 由is paper , Min-Max game tree search algorithm to search , according to theα-ß pruning al- gorithm valuation game tree depth , designed game model search depth can be pruned. The game model to solve the game progr副n layout , the depth of the valuation and search the problem such as time-consuming , raised the search efficiency and performance. The game program h臼 won the second prize in the National College Students Game competition , tested in practice and application. 币lis result shows that the game model is feasible and effective. Keywords: computer game; depth; search; layout; g缸ne tree 有所提升，布局[2] 和估值深度[3] 是当前主要的问 题，搜索效率也是