Semi-Strongly solved: a New Definition Leading Computer to Perfect Gameplay

ArXi:2411.01029v2 Announce Type: replace Strong solving of perfect-information games certifies optimal play from every reachable position, but the required state-space coverage is often prohibitive. Weak solving is far cheaper, yet it certifies correctness only at the initial position and provides no formal guarantee for optimal responses after arbitrary deviations.