Title :
A model for the connectedness of stones in the game of Go
Author :
Sato, Masafumi ; Anada, Koichi ; Tsutsumi, Masayoshi
Author_Institution :
Dept. of Appl. Math., Waseda Univ., Tokyo, Japan
Abstract :
We consider the connectedness in the game of Go. This game has a graph theoretical structure and the connectedness of the stones is very important to evaluate positions. In this paper, we construct the mathematical model which represents the connectedness of the stones and the relationship between blocks and null intersections. We propose the recursion of extended liberties to evaluate positions analytically.
Keywords :
game theory; blocks intersections; extended liberties; game of Go; graph theoretical structure; mathematical model; null intersections; Boards; Complexity theory; Games; Law; Mathematical model; connectedness; graph theory; the game of Go;
Conference_Titel :
Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2015 16th IEEE/ACIS International Conference on
Conference_Location :
Takamatsu
DOI :
10.1109/SNPD.2015.7176259
