A model for the connectedness of stones in the game of Go

Masafumi Sato, Koichi Anada, Masayoshi Tsutsumi

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

We consider the connectedness in the game of Go. This game has a graph theoretical structure and the connectedness of the stones is very important to evaluate positions. In this paper, we construct the mathematical model which represents the connectedness of the stones and the relationship between blocks and null intersections. We propose the recursion of extended liberties to evaluate positions analytically.

本文言語English
ホスト出版物のタイトル2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781479986767
DOI
出版ステータスPublished - 2015 8月 3
イベント16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Takamatsu, Japan
継続期間: 2015 6月 12015 6月 3

Other

Other16th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015
国/地域Japan
CityTakamatsu
Period15/6/115/6/3

ASJC Scopus subject areas

  • 人工知能
  • コンピュータ ネットワークおよび通信
  • コンピュータ サイエンスの応用
  • ソフトウェア

フィンガープリント

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

引用スタイル