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.
|ジャーナル||Journal of Computational Methods in Sciences and Engineering|
|出版ステータス||Published - 2017|
ASJC Scopus subject areas
- コンピュータ サイエンスの応用