Pattern matching and Monte-Carlo simulation mechanism for the game of NoGo
Authors:
- 1 October 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 01 (23765933) , 61-64
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- Fuzzy Markup Language for game of NoGo2011
- Contextual patterns and pattern collocations in the game of GO2011
- Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo2011
- Current Frontiers in Computer GoIEEE Transactions on Computational Intelligence and AI in Games, 2010
- Representation and Comparison of Fuseki Patterns of Go-Games2008
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH2007
- Monte-Carlo Go Reinforcement Learning Experiments2006
- Deep BlueArtificial Intelligence, 2002
- Games solved: Now and in the futureArtificial Intelligence, 2002
- Computer Go: An AI oriented surveyArtificial Intelligence, 2001