期刊文献+

中国象棋中亚洲棋规循环问题的解决 被引量:1

Solving Repetition of Asian-Rule in Chinese Chess
下载PDF
导出
摘要 在中国象棋中,由于其特殊的循环判定规则,使得循环问题成为了一个大挑战,为此,提出了一个较为理想的模型.在解决循环的方向上,对亚洲规则进行了一些归类及合并,从而大幅简化了规则.该模型首先根据亚洲规则循环对棋中出现的循环进行发现探测,然后对发现的循环进行判断,得到对弈双方的胜负结果.实验结果表明了所提模型的有效性和实用性. The repetition judgment is a big challenge due to the unique restrictions in Chinese Chess.To solve the problem,an ideal model was proposed.For solving the repetition direction,the Asian-rule was classified and incorporated to greatly simplify the rule.The proposed model detects firstly repetition according to Asian-rule,and then judges the detected repetition to obtain which side in the repetition will win.The experimental results indicated the validity and practicability of the presented model.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第4期476-481,共6页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(60970157) 教育部博士点新教师基金资助项目(20090042120031)
关键词 计算机博弈 中国象棋 循环 亚洲规则 建模 computer games Chinese chess repetition Asian-rule modeling
  • 相关文献

参考文献7

  • 1Yen S J,Chen,J C,Yang T N,et al.Computer Chinesechess[J].ICGA Journal,2004,27(1):3-18.
  • 2Vidanovic D,Vuckovic V.An algorithm for the detection ofmove repetition without the use of hash-keys[J].YugoslavJournal of Operations Research,2007,17(2):257-274.
  • 3Fang H R,Hsu T S,Hsu S C.Construction of Chinese chessendgame databases by retrograde analysis[J].Lecture Notes inComputer Science,2001,2063:96-114.
  • 4Campbell M.Knowledge discovery in deep blue comm[J].Communcation of ACM,1999,42(11):65-67.
  • 5Zobrist A.New hashing method with applications for gameplaying[J].ICCA Journal,1990,13(2):69-73.
  • 6Breuker D M,Uiterwijk J W H M,HerikH J.Information intransposition tables[J].Advances in Computer Chess,1997,27:199-211.
  • 7Winands M H M,Werf E C D,Herik H J.Adaptive nul-lmove pruning[J].ICCA Journal,2006,22(3):123-132.

同被引文献12

  • 1许南山,丛磊,孙风平.并行实现有自学习能力的五子棋AI[J].计算机工程与应用,2006,42(30):45-47. 被引量:4
  • 2Rutko D.Fuzzified tree search in real domain games[C] //Proc of International Conference on Advances in Artificial Intelligence.Berlin:Springer,2011:149-161.
  • 3Reinefld A.An improvement of the scout tree-search algorithm[J].Journal of the International Computer Chess Association,1983,6(4):4-14.
  • 4Strnad D,Guid N.Parallel alpha-beta algorithm on the GPU[C] // Proc of the 33rd International Conference on Information Technology Interfaces.Washington DC:IEEE Computer Society,2011:571-576.
  • 5The OpenMP API specification for parallel programming[EB/OL].[2013-10-01].http://openmp.org/mp-documents/OpenMP-4.0-C.pdf.
  • 6Lyu Huizhan,Xiao Chenjun,Li Hongye,et al.Hash table in Chinese chess[C] // Proc of the 24th Chinese Control and Decision Conference.Washington DC:IEEE Computer Society,2012:3286-3291.
  • 7Papadopoulos A,Toumpas K,Chrysopoulos A,et al.Exploring optimization strategies in board game abalone for alpha-beta search[C] // Proc of IEEE Conference on Computational Intelligence and Games.Washington DC:IEEE Computer Society,2012:63-70.
  • 8Kunihito H,Masakazu M.Efficiency of three forward-pruning techniques in Shogi:futility pruning,null-move pruning,and late move reduction (LMR)[J].Journal of the Entertainment Computing,2012,3(3):51-57.
  • 9Liu Yanli,Zhang Heng,Fu Ping.A hybrid game-tree search algorithm for playing chess[J].Journal of Computational Information Systems,2012,8(14):5803-5811.
  • 10陈国良,孙广中,徐云,吕敏.并行算法研究方法学[J].计算机学报,2008,31(9):1493-1502. 被引量:44

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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