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

Graph Model
Game
Formulation
Recursion
Connectedness
Intersection
Graph in graph theory

Keywords

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

ASJC Scopus subject areas

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

Cite this

Formulations of patterns by a graph model for the game of Go. / Sato, Masafumi; Anada, Koichi; Tsutsumi, Masayoshi.

In: Journal of Computational Methods in Sciences and Engineering, Vol. 17, No. S1, 2017, p. S111-S121.

Research output: Contribution to journalArticle

@article{c0b8ae6522824cd4b5aaf574de2d1b6f,
title = "Formulations of patterns by a graph model for the game of Go",
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 = "connectedness, Graph theory, nakate, takefu, the Game of Go",
author = "Masafumi Sato and Koichi Anada and Masayoshi Tsutsumi",
year = "2017",
doi = "10.3233/JCM-160684",
language = "English",
volume = "17",
pages = "S111--S121",
journal = "Journal of Computational Methods in Sciences and Engineering",
issn = "1472-7978",
publisher = "IOS Press",
number = "S1",

}

TY - JOUR

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

AU - Sato, Masafumi

AU - Anada, Koichi

AU - Tsutsumi, Masayoshi

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - connectedness

KW - Graph theory

KW - nakate

KW - takefu

KW - the Game of Go

UR - http://www.scopus.com/inward/record.url?scp=85012117646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85012117646&partnerID=8YFLogxK

U2 - 10.3233/JCM-160684

DO - 10.3233/JCM-160684

M3 - Article

VL - 17

SP - S111-S121

JO - Journal of Computational Methods in Sciences and Engineering

JF - Journal of Computational Methods in Sciences and Engineering

SN - 1472-7978

IS - S1

ER -