This paper presents a tournament-oriented framework for analyzing HKDGoInfinity-1, a Go engine tested on the Computer Go Server (CGOS). The intended audience ranges from a reader meeting atari for the first time to strong dan players interested in forcing order, ko risk, and endgame conversion. We introduce three locally checkable tactical certificates: capture safety, liberty-monotone forc ing, and area-safe conversion. Each certificate is modest by design: it does not “solve Go,” but identifies a position in which a claimed local conclusion follows from explicit assumptions. Custom Python code reconstructs board diagrams from CGOS/SGF records and audits Chinese area scores. In the author’s current tournament sample, the engine’s observed win rate is approximately 56%; this figure and the comparison with the player prefix kg_ are provisional until the underlying server export is archived with this paper. The larger lesson is that strong play be comes more intelligible when a spectacular move arrives with a small, inspectable proof.
Keywords
Go, Computer Go Server, CGOS, Chinese area rules, atari, tactical search, proof certificate, dan level play, reproducibility.
A Go engine earns attention by winning, but it earns trust by making its claims reproducible. HKDGoInfinity-1’s reported 56% tournament run is a promising headline. The durable contribution is the proposed bridge from CGOS records to diagrams, area audits, uncertainty in tervals, and finite tactical certificates. In Go, infinity is a poetic name. On the board, the best explanations remain beautifully finite.
References
[1] R. Coulom, “Efficient Selectivity and Backup Opera tors in Monte-Carlo Tree Search,” in Computers and Games, LNCS 4630, Springer, 2007, pp. 72–83. [2] D. Silver et al., “Mastering the Game of Go without Human Knowledge,” Nature, vol. 550, pp. 354–359, 2017. [3] J. Tromp and G. Farnebäck, “Combinatorics of Go,” in Computers and Games, LNCS 4630, Springer, 2007, pp. 84–99.
📋 How to Cite This Paper
Michael S Yang (2026). HKD Infinity Go-1: It don’t matter if it’s black or white. International Journal of Computer Techniques, 13(5), 381–383. ISSN: 2394-2231. DOI: https://doi.org/10.5281/zenodo.22859516
