First-Player Non-Negativity and Proof-Carrying Regional DAG Strategy Certificates for Positional-Superko Go

Under positional superko (PSK), two occurrences of the same Go board can admit different moves. In Lean 4 we show that the visible position together with the set of all past boards forms a strong bisimulation. This quotient mechanizes Weninger and Hayward's opening-pass proof that Black can force a nonnegative margin on every square board under no-suicide, pass-exempt PSK and double-pass area scoring. For regional play, maximal historical Black footprints give a sufficient test of global freshness. A connected-exterior capacity bound lets a verified checker lift a corner directed acyclic graph (DAG) to a full-board strategy. The terminal geometry allows enemy stones inside vital chambers while preserving every core stone and counting singleton eyes as guaranteed area. On a 12-ply $19\times 19$ position, the checker validated a DAG with $1{,}700{,}986$ nodes and $2{,}007{,}462$ edges and generated a strategy certificate for margin at least $-345$. Its leaves certify at least eight Black area points in the corner. At the 11-ply position, a single execution assembles certificates for all 351 legal non-resigning White replies. It lifts the resulting certificate to the actual 10-ply predecessor through Black's move at (2,1).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24223963
Primary Topic
Artificial Intelligence in Games
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

First-Player Non-Negativity and Proof-Carrying Regional DAG Strategy Certificates for Positional-Superko Go

Jian Gao
Zenodo (CERN European Organization for Nuclear Research)
Artificial Intelligence in Games
preprint

First-Player Non-Negativity and Proof-Carrying Regional DAG Strategy Certificates for Positional-Superko Go

Jian Gao
preprint en

Abstract

Under positional superko (PSK), two occurrences of the same Go board can admit different moves. In Lean 4 we show that the visible position together with the set of all past boards forms a strong bisimulation. This quotient mechanizes Weninger and Hayward's opening-pass proof that Black can force a nonnegative margin on every square board under no-suicide, pass-exempt PSK and double-pass area scoring. For regional play, maximal historical Black footprints give a sufficient test of global freshness. A connected-exterior capacity bound lets a verified checker lift a corner directed acyclic graph (DAG) to a full-board strategy. The terminal geometry allows enemy stones inside vital chambers while preserving every core stone and counting singleton eyes as guaranteed area. On a 12-ply $19\times 19$ position, the checker validated a DAG with $1{,}700{,}986$ nodes and $2{,}007{,}462$ edges and generated a strategy certificate for margin at least $-345$. Its leaves certify at least eight Black area points in the corner. At the 11-ply position, a single execution assembles certificates for all 351 legal non-resigning White replies. It lifts the resulting certificate to the actual 10-ply predecessor through Black's move at (2,1).

Zenodo (CERN European Organization for Nuclear Research)
Artificial Intelligence in Games
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon