Combinatorial games modeling seki in Go (Q2017043): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Vladimir A. Gurvich / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Diogo V. Andrade / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Gábor Rudolf / rank | |||
Normal rank |
Revision as of 21:34, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial games modeling seki in Go |
scientific article |
Statements
Combinatorial games modeling seki in Go (English)
0 references
25 June 2014
0 references
This paper describes results and conjectures on two closely related games, SEKI and D-SEKI, played on matrices of non-negative integers. These games were inspired of so-called seki positions in the game Go. This paper should be viewed as an investigation into the structure of SEKI and D-SEKI, without particular practical applications to Go. The two games are two-player turned-based perfect information partizan finite games which can end in a draw, so a priori there are nine possible outcome classes for SEKI and D-SEKI positions. Most of the paper consists of partial characterizations of the matrices that fall into particular outcome classes. The authors pay particular attention to the drawn matrices, called \textit{seki}, and single out among the seki the drawn matrices where each player has a unique non-losing move (\textit{complete seki}). The methods of the paper are combinatorial and elementary and the structure of the games seems interesting and pleasant. The paper contains four conjectures, three about complete seki and a fourth about seki, that seem amenable to both computer-aided brute force analysis and more mathematical methods.
0 references
combinatorial games
0 references
Go
0 references
draw
0 references
pass
0 references
seki
0 references