期刊文献+

UCT算法在不围棋博弈中的实现 被引量:5

An Implementation of UCT Algorithm for NoGo Game
下载PDF
导出
摘要 计算机博弈是人工智能领域的挑战性课题,它利用计算机进行分析、判断和推理,从而得到理性的决策.不围棋是近年来计算机博弈竞赛的一个棋种,属于围棋的变体,其规则是先吃子或棋子自杀的一方为负.通过分析不围棋博弈模型的特点,提出了对上限信心界树搜索(UCT)算法的一个优化方法,在算法的启动过程优先选择评分较高的盘面进行模拟博弈,以便得到更好的落子选择.在与著名的OASE-NoGo软件的试验对弈中,以该算法为核心设计的不围棋软件取得了90%以上的胜率,证明是可行、有效的. Computer game is a challenging task in the field of artificial intelligence, which makes use of computer to analyze, judge and reason, so as to get the rational decision. In recent years, NoGo game is a kind of computer game competitions, similar to the game of Go, with the rules of no capture or suicide which is allowed. According to the characteristics of NoGo game model, an optimized UCT(UCB for Tree Search) algorithm is proposed to compute the better move by choosing certain chess layout with high score preferentially. A NoGo game software is designed mainly relies on the above-mentioned algorithm and proved to be feasible and efficient by the result of achieving more than 90% of winning with the famous OASE-NoGo.
出处 《韶关学院学报》 2015年第8期17-21,共5页 Journal of Shaoguan University
基金 国家级大学生创新创业训练计划项目(201410576018) 广东省大学生创新创业训练计划项目(201410576060) 韶关学院科研项目(2012-16)
关键词 人工智能 计算机博弈 不围棋 UCT算法 artificial intelligence computer game NoGo UCT algorithm
  • 相关文献

参考文献10

  • 1Denim S. Anti Atari Go[EB/OL]. (2011-12-07)[2014-8-301. http://senseis.xmp.net/?AntiAtariGo. 被引量:1
  • 2Auer P,Cesa-Bianchi N,Fischer P. Finite-time Analysis of the Multiarmed Bandit Problem [J]. Machine Learning,2002,47(2- 3):235-256. 被引量:1
  • 3Koesis L, SzepesvOri C. Bandit based monte-carlo planning [C ]//Proceedings of the 17th European conference on Machine Learning, Berlin in Germany: Springer-Verlag, 2006:282-293. 被引量:1
  • 4CHOU C W, Teytaud O, and YEN S J. Revisiting Monte-Carlo tree search on a normal form game: NoGo[C] // Proceedings of the 2011 international conference on Applications of Evolutionary Computation, Torino in Italy: Springer-Verlag, 2011:73-82. 被引量:1
  • 5LEE C S ,WANG M H ,CHEN Y J,et al.. Genetic fuzzy markup language for game of NoGo[J].Knowledge-Based Systems,2012(34): 64-80. 被引量:1
  • 6SUN Y X, LIU C, and QIU H K. The research on patterns and UCT algorithm in NoGo game[C]//25th Chinese Control and Deci- sion Conference, Guiyang:IEEE, 2013:1178-1182. 被引量:1
  • 7SUN Y X, WANG Y J, and LI F. Pattern matching and Monte-Carlo simulation mechanism for the game of NoGo[C]. // Proceed- ings of IEEE CCIS2012, Hangzhou:IEEE, 2012:61-64. 被引量:1
  • 8LI R, WU Y Q, ZHANG A D, et al. Technique analysis and designing of program with UCT algorithm for NoGo[C]//25th Chi- nese Control and Decision Conference, Guiyang:IEEE, 2013:923-928. 被引量:1
  • 9佘博玄,禁围棋程式设计与研究[D].台湾新竹:交通大学,2013. 被引量:1
  • 10SUN Y X, RAO G J, SUN H M, et al. Research on static evaluation method for computer game of NoGo[CI.//26th Chinese Con- trol and Decision Conference, Changsha:IEEE, 2014:3455-3459. 被引量:1

同被引文献16

引证文献5

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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