The Game of Go: A Cellular Automata Approach
José Manuel Gómez Soto and Diego Delgado Ávila
This paper shows a way to play the game of Go using cellular automata. To do this, we consider the best move depending on the player’s style: offensive, defensive, or neutral. The best move is characterized by the importance of the next points: Chain growth, growth of degrees of freedom, reduction of opponent’s degrees of freedom or capture of opponent’s stones. We use cellular automata to compute these problems for each possible move and determine the next move. We also use cellular automata to evaluate the board at each moment and determine which player wins in the endgame.
Keywords: Cellular automata, game of Go