• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Chinese Control and Decision Conference >The Research on Patterns and UCT Algorithm in NoGo Game
【24h】

The Research on Patterns and UCT Algorithm in NoGo Game

机译：Nogo游戏模式和UCT算法研究

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

NoGo game is similar to Go game, that means they have similar notion of group, killing, stones and chessboard. However, their rulers are completely different, or opposite, like the first player suicides, kills a group, or has no more legal moves, the opponent will win the game. In this paper, the patterns of NoGo are expounded in detail. The pattern values, the pattern sizes and the pattern formats are discussed. At the same time, an optimizing pattern matching algorithm is put forward to find out the best move for NoGo game. In addition, if the best move has not been found by the matching pattern algorithm, a modified UCT algorithm is also applied to play the NoGo game. The experimental results show that the proposed approaches are workable for NoGo.
机译：Nogo游戏类似于Go游戏，这意味着它们具有类似的概念，杀戮，石头和棋盘。然而，他们的统治者完全不同，或者相反，就像第一球员自杀一样，杀死一个团体，或者没有更多的法律举措，对手将赢得比赛。在本文中，Nogo的模式详细阐述。讨论模式值，模式大小和模式格式。同时，提出了优化模式匹配算法，以找出Nogo游戏的最佳举动。另外，如果匹配模式算法尚未找到最佳移动，则还应用了一种修改的UCT算法来播放Nogo游戏。实验结果表明，该拟议方法可用于Nogo。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号