期刊文献+

一个幻影围棋计算机博弈系统的设计与实现 被引量:1

Design and implement of a Phantom Go computer game system
下载PDF
导出
摘要 幻影围棋作为一个刚兴起不久的棋类游戏,属于不完全信息博弈,目前对幻影围棋的研究与开发较少,在国内才刚刚起步。分析了幻影围棋计算机博弈系统的模型与结构,结合Alpha-Beta搜索算法和蒙特卡洛算法的优势,依据棋盘状态采用不同的搜索算法,调用搜索引擎产生下子,在此基础上开发实现了一个幻影围棋博弈系统,能有效的交互和处理信息,并通过了运行测试。 Phantom Go is a new game as a kind of incomplete irfformation. At present, there is less research and develop- ment of Phantom Go, and it has just began in China. At first, this paper analyzes the structure and functional module of the Phantom Go computer game system. Then, combining with the strengths of Alpha-Beta search algorithm and Monte-Carlo algorithm, the paper uses different search algorithm according to the state of board. Furthermore, the scheme generates the next step by means of the search engine. Based on the above design, we developed a Phantom Go game system that cart ef- fectively interact and process information. Finally, we test and evaluate the Phantom Go game system. The results show it achieves the desired goals.
出处 《数字通信》 2014年第1期1-6,共6页 Digital Communications and Networks
基金 国家自然科学基金(61271259 61301123) 重庆市自然科学基金(CTSC2011jjA40006) 重庆市教委项目(Kjzh11206) 重庆市教科委项目(KJ120824) 重庆市教委科学技术研究项目(KJ120501 KJ120502 KJ130536)
关键词 计算机博弈 幻影围棋 不完全信息博弈 Alpha-Beta 蒙特卡洛 computer game, Phantom Go, game of incomplete information, alpha-Beta, Monte-Carlo
  • 相关文献

参考文献14

  • 1幻影围棋规则[EB/OL][2013-09-30]http://www.caaigames.cn/show.php- id=259.
  • 2徐心和,徐长明.计算机博弈原理与方法学概述[C].中国人工智能进展:2009.北京:北京邮电出版社,2009.10.
  • 3EPPSTEN D.最小最大搜索[EB/OL][2013-09-30].http://www.xqbase.com/computer/search_minimax.htm.
  • 4徐心和,王骄.中国象棋计算机博弈关键技术分析[J].小型微型计算机系统,2006,27(6):961-969. 被引量:61
  • 5MORELAND B.迭代加深[EB/OL][2013-09-30].http://www.xqbase.com/computer/search_iterative.htm.
  • 6MORELAND B.置换表[EB/OL][2013-09-30].http://www.xqbase.com/computer/search_hashing.htm.
  • 7KNUTH D E,MOORE R N.An analyze of Alpha-Beta pruning[J].Artificial Intelligence,1975 6 (4):293-326.
  • 8Bernd Brugmann,FohringerRing 6.Monte Carlo Go[EB/OL][2013-09-30].http://www.ideanest.com/vegos/MonteCarloGo.pdf.
  • 9KOCSIS L.SZEPESVARI C.Bandit based monte-carlo planning[C]//In 15th European Conference on Machine Learning (ECML),2006:282-293.
  • 10CAZENAVE T.A phantom go program[C]//ACG 2005,LNCS 4250,Taipei,Taiwan:[s.n.],2005:120-125.

二级参考文献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

共引文献63

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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