[Depreciated and replaced by V3] Solving Chess Completely: Residue Field Partitioning and Algebraic Varieties of Game-Theoretic Outcomes
Abstract
[Depreciated and replaced by V3] The application-specific clean rebuild has not yet been published; its authoritative theoretical boundary is now the governing V3 branch: After Turing: The Fold Machine - An Exact, Parameter-Free and Machine-Closed Derivation of Classical Computational Science from Smithian Fold Theory. The V3 source platform is https://github.com/MettaMazza/ernos-labs-sft-platform. The original DOI, concept DOI, version number and files are preserved for transparent historical provenance; this record must not be presented or cited as current V3 work.Bijective coordinates, modular move operators, and LLL-based variety boundary equations solving Chess endgames algebraically in the residue field. Version 2 includes comprehensive benchmarking against Stockfish 18 (depth 12 and 18), Leela Chess Zero (Lc0 Standard), and Maia Chess ELO sparring models.
Fields of Study & Subjects
Artificial Intelligence in Games
Logic
programming
and type systems
Computability
AI Algorithms
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 8 June 2026