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

Programming Research Based on Game of Checkers

作　　者：郑昌松 贾丽娟[1] 权贺 王彪[1] 

机构地区：[1]哈尔滨理工大学自动化学院,黑龙江哈尔滨150080

出　　处：《哈尔滨理工大学学报》2016年第3期24-28,共5页Journal of Harbin University of Science and Technology

基　　金：黑龙江省自然科学基金(F200818);哈尔滨市科技计划项目(2005AFQXJ036)

摘　　要：为了提高计算机博弈水平,以西洋跳棋为研究对象设计博弈程序.采用Min-Max搜索算法实现对博弈树的搜索,根据α-β剪枝算法研究博弈树的估值深度,设计了搜索深度可以剪枝的博弈模型.该博弈模型解决了博弈程序布局方式、估值深度和搜索耗时等问题,提高了程序搜索效率和博弈性能.博弈程序在全国大学生博弈比赛中获得二等奖,在实际中得到了检验和应用,比赛结果表明了该博弈模型是可行和有效的.In order to improve the level search of checkers. In this paper, Min-Max gorithm valuation game tree depth, designed of the computer game, we designed a game program based on the re- game tree search algorithm to search, according to the α-β pruning algame model search depth can be pruned. The game model to solve the game program layout, the depth of the valuation and search the problem such as time-consuming, raised the search efficiency and performance. The game program has won the second prize in the National College Students＇ Game competition, tested in practice and application. This result shows that the game model is feasible and effective.

关 键 词：计算机博弈 深度 搜索 布局 博弈树 

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