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

Masafumi Sato, Koichi Anada, Masayoshi Tsutsumi

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)S111-S121
JournalJournal of Computational Methods in Sciences and Engineering
Volume17
Issue numberS1
DOIs
Publication statusPublished - 2017

    Fingerprint

Keywords

  • connectedness
  • Graph theory
  • nakate
  • takefu
  • the Game of Go

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science Applications
  • Computational Mathematics

Cite this