期刊文献+

四国军棋游戏中搜索算法的实验与分析 被引量:1

Experiment and Analysis of Search Algorithms in Siguo Games
下载PDF
导出
摘要 详细分析了四国军旗智能系统中使用的5种主流博弈算法(Alpha-Beta算法、Aspiration算法、PVS算法、SSS*算法和MT-SSS*算法),并通过实验对5种算法性能进行比较.提出了在四国军旗游戏中使用集成搜索思想,即在四国军旗智能系统中开局使用Aspiration搜索算法,中后局采用MT-SSS*算法. Game playing is one of the classic problems of artificial intelligence. It is a key study on search algorithm in most game-playing programs. The paper discusses several mainstream search algorithms, which is Alpha-Beta, Aspiration, PVS, SSS~ and MT- SSS', respectively. A plenty of experiments are made to compare and analyze the performance of these algorithms. Making use of above discuss results, The paper presents integration idea to use search algorithm in the Siguo game, that is, Aspiration algorithm in the beginning phase and MT-SSS' in the middle and end-phase .
作者 陆慧 夏正友
出处 《江南大学学报(自然科学版)》 CAS 2007年第6期744-748,共5页 Joural of Jiangnan University (Natural Science Edition) 
基金 江苏省自然科学基金项目(BK2006567)
关键词 计算机博弈 搜索算法 Alpha—Beta算法 SSS’算法 MTD—SSS’算法 四国军旗游戏 the game tree search algorithms Alpha-Beta algorithm SSS' algorithm' MTD- SSS' algorithm siguo game
  • 相关文献

参考文献13

  • 1Aske Plaat. Research re: search and research[D], NL: Erasmus University Rotterdam, 1996.
  • 2Gerard M Baudet. The design and analysis of algorithms for asynchronous multiprocessors[D]. Pittsburgh: Carnegie Mellon University, 1978.
  • 3Murray S Campbell, Anthony Marsland T. A comparison of minimax tree search algorithms[J]. Artificial Intelligence, 1983,20,347-367.
  • 4Lewis Stiller. Multili near Algebra and Chess End Games,Games of No Chance[M]. San Frandsco:MSRI Publications, 1996.
  • 5Jonathan Schaeffer. The history heuristicand Alpha-Beta search enhancements in practice[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1989,11 (1) : 1203-1212.
  • 6Yasuhito Kawano. Using Similar Positions to Search Game Trees, Games of No Chance[M]. San Francisco: MSRI Publications, 1996.
  • 7George C Stockman. A minimax algorithm better than Alpha-Beta? [J]. Artificial Intelligence, 1979,12(2): 179-196.
  • 8Aske Plaat, Jonathan Schaeffer, Wim Pijls, et al. Best-first and depth-first minimax search in practice [C]// Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95). Montreal,Canada: American Association for Artificial Intellgent, 1995 : 273-279.
  • 9徐心和,王骄.中国象棋计算机博弈关键技术分析[J].小型微型计算机系统,2006,27(6):961-969. 被引量:61
  • 10Russell S J, Norvig P. Artificial Intelligence: A Modern Approach[M]. Englewood Cliffs, Prentice-Hall,1995.

二级参考文献28

  • 1Newborn M. Recent progress in computer chess[J]. Advances in Computer, 1978, 18:59-117.
  • 2Don F Beal. A generalised quiescence search algorithm, department if computer science, queen mary college[J]. London University, Artificial Intelligence, 1990,43: 85-98.
  • 3Ed Schroder. How rebel plays chess [EB/OL]. http://membets. home. nl/matador/chess840.htm, 2002.
  • 4Chrilly Donninger, Null move and deep search:selective-search heuristics for obtuse chess programs[J]. ICCA Journal, 1993,16(3):137-143.
  • 5Zobrist A. A new hashing method with application for game playing[R]. Computer Science Department, University of Wisconsin, Madison, 1970.
  • 6Wu R, Beal D F. A memory efficient retrograde algorithm and its application to Chinese chess cndgames[J]. More Games of No Chance MSRI Publications, 2002,42 :207-228.
  • 7Yen S J, Chen J C, Yang T N. Computer Chinese chess[J]. ICGA Journal, September 2005, 28(3):182-184.
  • 8Chen S H. Design and implementation of a practical endgame database for Chinese chess[D]. Department of Computer Science and Information Engineering, National Taiwan University,Taiwan, 1998.
  • 9Fang H R, Hsu T S, Hsu S C. Indefinite sequence of moves in Chinese chess endgames[C]. In:Proceedings of the Third International Conference on Computers and Games, 2002:264-279.
  • 10ftp://ftp. cis. uab. edu/pub/hyatt/src

共引文献60

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部