[1]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(2):39-43.
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
1
Number of periods:
2006 2
Page number:
39-43
Column:
学术论文—人工智能基础
Public date:
2006-10-25
- Title:
-
Adaptive time allocation strategy in? computer game of Chinese Chess
- 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
- CLC:
-
TP18
- DOI:
-
-
- 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.