Formulations of patterns by a graph model for the game of Go

Issue title: Selected papers from the ISCA International Conference on Software Engineering and Data Engineering, and the ISCA International Conference on Computer Applications in Industry and Engineering, 2015, and Invited Papers

Guest editors: Takaaki Goto and Narayan C. Debnath

Article type: Research Article

Authors: Sato, Masafumi^{a; *} | Anada, Koichi^b | Tsutsumi, Masayoshi^a

Affiliations: [a] Waseda University, Shinjuku-ku, Tokyo, Japan | [b] Waseda University, Kamishakujii, Nerima-ku, Tokyo, Japan

Correspondence: [*] Corresponding author: Masafumi Sato, Waseda University, 1-104 Totsuka-machi, Shinjuku-ku, Tokyo 169-8050, Japan. E-mail:beulah.griffe@gmail.com

Abstract: 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 and takefu moves by using the BW graph model.

Keywords: Graph theory, connectedness, the Game of Go, nakate, takefu

DOI: 10.3233/JCM-160684

Journal: Journal of Computational Methods in Sciences and Engineering, vol. 17, no. S1, pp. S111-S121, 2017