中国象棋机器博弈的时间自适应分配策略研究  

Adaptive time allocation strategy in computer game of Chinese Chess

作　　者：徐长明 南晓斐[1] 王骄[1] 徐心和[1] 

机构地区：[1]东北大学人工智能与机器人研究所,辽宁沈阳110004

出　　处：《智能系统学报》2006年第2期39-43,共5页CAAI Transactions on Intelligent Systems

摘　　要：时间分配问题在象棋比赛中是十分重要的策略问题,在机器博弈中也是如此。好的策略可以把宝贵的时间资源用在“刀刃”上;此外,好的时间分配策略还要有好的自适应性,亦即对大多数比赛,无论其限时的长短、步数的多寡,该策略都能合理利用时间。在分析和建立了时间分配的数学模型的基础上,介绍了自适应时间分配与调整的策略和算法。时间分配问题与搜索和评估密切相关,也影响着机器博弈的风格。Time Allocation is a typical and important strategy problem in chess matches, so does in computer games. A good strategy can allocate time for each searching-step to make the best use of it. Furthermore, a good allocation strategy should be adaptive, namely, fitting most contests, regardless of the length of time limit, or the number limit of steps. Based on analysing and establishing the mathematic model of time allocation, this paper introduces an adaptive algorithm of time allocation and adjustnemt. The method ties up with the searching and evalation module, and also affects the style of computer games.

关 键 词：机器博弈 时间分配策略 自适应 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]