[1]徐长明,南晓斐,王 骄,等.中国象棋机器博弈的时间自适应分配策略研究[J].智能系统学报,2006,1(02):39-43.
 XU Chang-ming,NAN Xiao-fei,WANG Jiao,et al.Adaptive time allocation strategy in computer game of Chinese Chess[J].CAAI Transactions on Intelligent Systems,2006,1(02):39-43.
点击复制

中国象棋机器博弈的时间自适应分配策略研究(/HTML)
分享到:

《智能系统学报》[ISSN:1673-4785/CN:23-1538/TP]

卷:
第1卷
期数:
2006年02期
页码:
39-43
栏目:
出版日期:
2006-10-25

文章信息/Info

Title:
Adaptive time allocation strategy in  computer game of Chinese Chess
文章编号:
1673-4785(2006)02-0039-05
作者:
徐长明南晓斐王 骄徐心和
东北大学人工智能与机器人研究所,辽宁沈阳110004
Author(s):
XU Chang-ming NAN Xiao-fei WANG Jiao XU Xin-he
Institute of Artificial Intelligence and Robotics, Northeastern University, Shenyang 110004, China
关键词:
机器博弈时间分配策略自适应
Keywords:
computer games time allocation strategy adaptive
分类号:
TP18
文献标志码:
A
摘要:
时间分配问题在象棋比赛中是十分重要的策略问题,在机器博弈中也是如此。好的策略可以把宝贵的时间资源用在“刀刃”上;此外,好的时间分配策略还要有好的自适应性,亦即对大多数比赛,无论其限时的长短、步数的多寡,该策略都能合理利用时间。在分析和建立了时间分配的数学模型的基础上,介绍了自适应时间分配与调整的策略和算法。时间分配问题与搜索和评估密切相关,也影响着机器博弈的风格。
Abstract:
Time Allocation is a typical and important strategy problem in chess m atches, so does in computer games. A good strategy can allocate time for each s earching-step to make the best use of it. Furthermore, a good allocation strateg y 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 algori thm of time allocation and adjustnemt. The method ties up with the searching and evalation module, and also affects the style of computer games. 

参考文献/References:

[1]黄 晨.解剖大象的眼睛——中国象棋程序设计探索[EB/OL].http://www.elephant base.net/computer/eleeye_ponder.htm. 2005.11.
[2]王孔兴.象棋竞赛裁判手册[M].北京:人民体育出版社,2001. 
[3]SCHAEFFER J. The history heuristic and alphabeta search enhancements in p ra ctice[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1989 , 11(11) : 1203-1212. 
[4]REINEFELD A, MARSLAND T A. Enhanced iterativedeepening search[J].IEEE T ransactions on Pattern Analysis and Machine Intelligence, 1994,7(7):701-710. 
[5]KORF R E, REID M, EDELKAMP S. Time complexity of iterativedeepeningA[ J].Artificial Intelligence,2001,129(1-2):199-218.
[6]徐心和,王 骄.中国象棋计算机博弈关键技术分析[J].小型微型计算机系统,2006,27(6):961-969.
 XU Xinhe, WANG Jiao. Key technologies analysis of chinese chess computer game [J]. MiniMicro Systems. 2006,27(6):961-969.
[7] 王小春.PC游戏编程[M].重庆:重庆大学出版社, 2002.

相似文献/References:

[1]徐心和,邓志立,王骄,等.机器博弈研究面临的各种挑战[J].智能系统学报,2008,3(04):287.
 XU Xin-he,DENG Zhi-li,WANG Jiao,et al.Challenging issues facing computer game research[J].CAAI Transactions on Intelligent Systems,2008,3(02):287.
[2]张小川,唐艳,梁宁宁.采用时间差分算法的九路围棋机器博弈系统[J].智能系统学报,2012,7(03):278.
 ZHANG Xiaochuan,TANG Yan,LIANG Ningning.A 9×9 Go computer game system using temporal difference[J].CAAI Transactions on Intelligent Systems,2012,7(02):278.
[3]李学俊,王小龙,吴蕾,等.六子棋中基于局部“路”扫描方式的博弈树生成算法[J].智能系统学报,2015,10(02):267.[doi:10.3969/j.issn.1673-4785.201401022]
 LI Xuejun,WANG Xiaolong,WU Lei,et al.Game tree generation algorithm based on local-road scanning method for connect 6[J].CAAI Transactions on Intelligent Systems,2015,10(02):267.[doi:10.3969/j.issn.1673-4785.201401022]

备注/Memo

备注/Memo:
收稿日期:2006-07-22.
作者简介:
徐长明,男,1978年生,博士研究生,主要从事中国象棋的机器博弈、计算机网络等的研究。
E-mail: changmingxu@gmail.com
 南晓斐,女, 1983年生,硕士研究生,主要从事机器博弈的研究。
王 骄,男 , 1978 年生,博士研究生,研究方向为人工智能与机器博弈。
徐心和,男,1940 年生,教授,博士生导师,研究方向为控制理论与应用、系统仿真、智能机器人、机器博弈等
更新日期/Last Update: 2009-04-27