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

Masafumi Sato*, Koichi Anada, Masayoshi Tsutsumi

*この研究の対応する著者

研究成果: Article査読

3 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)S111-S121
ジャーナルJournal of Computational Methods in Sciences and Engineering
17
S1
DOI
出版ステータスPublished - 2017

ASJC Scopus subject areas

  • 工学(全般)
  • コンピュータ サイエンスの応用
  • 計算数学

フィンガープリント

「Formulations of patterns by a graph model for the game of Go」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル