The game of Go has a graph theoretical structure. Connected stones and enclosed regions are very worthful. On the other hand, we need to recalcurate groups of connected stones at each change of connectedness. BW Graph model gives us one of clear representations of features of positions with connectednesses and its recursions. By using recursions of positions, we can return from a given position to a previous position. In this paper, we focus on two moves, nakate and takefu. Nakate and takefu change connectednesses of intersections. We make static formulations of nakate andtakefu moves by using the BW graph model.
ThorpE. and WaldenW.E., A computer assisted study of Go on M by N boards, Information Sciences4(1) (1972), 1-33.
2.
BensonD.B., Life in the game of go, Information Sciences10 (1976), 17-29.
3.
GraepelT., GoutrieM., KrügerM. and HerbrichR., Learning on Graphs in the Game of Go, Proc. the Ninth International Conference on Artificial Neural Networks, 347-352.
4.
RalaivolaL., WuL. and BaldiP., SVM and Pattern-Enriched Common Fate Graphs for the Game of Go, Proc. European Symposium on Artificial Neural Networks Belgium (ESANN'2005), 485-490.
5.
SatouM., AnadaK. and TsutsumiM., A Model for the connectedness in the game of Go, Proc. 16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD2015) (2015), 561-566.
6.
SatouM., AnadaK. and TsutsumiM., A Mathematical Formulation Based on the Connectedness of Stones for the Game of Go, International Journal of Computer & Information Science16(4) (2015), 1-10.
7.
SatouM., AnadaK. and TsutsumiM., A Mathematical Formulation to Efficiently Determine Life Status in the Game of Go, Proc. IEEE International Conference on Industrial Technology (ICIT2016) (2016), 1684-1689.
