PATTERN MATCHING AND MONTE-CARLO SIMULATION MECHANISM FOR THE GAME OF NOGO

摘要：

　　The game of NoGo is similar to Go,that means they have similar chessboard and stones.However,the rulers are completely different.If 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 given to both players,Black and White,and the urgency of a pattern is represented by its value.At the same time,an improved pattern matching algorithm is put forward to find out the best move for the game of NoGo.In addition,if the best move has not been found by matching pattern,an optimized Monte-Carlo simulation mechanism is also applied to play the game of NoGo.The experimental results show that the proposed approaches are workable for NoGo.

关键词： NoGo Computer games Patterns Montecarlo simulation

作者: Yuxia Sun Yajie Wang Fei Li

作者单位: Engineering Training Center,Shenyang Aerospace University,Shenyang 110136,China

会议类型: 国际会议

会议名称: 2012 2nd IEEE International Conference on Cloud Computing and Intelligence Systems (2012年第2届IEEE云计算与智能系统国际会议(IEEE CCIS2012))

会议地点: 杭州

会议语种:英文

页码: 84-87

在线出版日期: 2012-10-30（万方平台首次上网日期，不代表论文的发表时间）