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

Masafumi Sato, Koichi Anada, Masayoshi Tsutsumi

研究成果: Conference contribution

2 引用 (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
Takamatsu
期間15/6/115/6/3

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Science Applications
  • Software

フィンガープリント A model for the connectedness of stones in the game of Go' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Sato, M., Anada, K., & Tsutsumi, M. (2015). A model for the connectedness of stones in the game of Go. : 2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings [7176259] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SNPD.2015.7176259