Discernibility Profiles and Mechanism Repertoires of Legal Reply Systems in Shogi
Authors/Creators
- 1. IndependentResearcher
Description
For a fixed legal shogi position and a legal candidate move, consider the complete finite set of legal replies. We observe each reply through three shogi-specific components: actor action edges lost after the reply ($\Lost$), actor action edges newly gained ($\Gain$), and the complete change in pieces in hand ($\Hand$). For every pair of replies, the components on which they differ form a discernibility set. The inclusion-minimal nonempty discernibility sets constitute a \emph{minimal discernibility skeleton}, which determines the complete family of observation reducts by hypergraph blocker duality. We treat each skeleton as a profile symbol. With three observation components, the abstract alphabet contains exactly 19 symbols, and we provide machine-verifiable legal witnesses showing that all 19 are reachable from the standard initial shogi position; hence the bound is sharp on standard-reachable legal play, not merely on abstract information systems.
We then factor every legal-reply observation into five local board-and-resource primitives: origin release, destination blocking, capture-step deletion at the destination, expenditure by a drop, and transfer by a capture. This factorization supplies local-mechanism certificates for every minimal discernibility edge. Moving from a chosen candidate to an entire position, we define the latent profile spectrum as the set of profiles realized by all legal candidate moves. Relation-relative endpoint certificates record added, removed, and retained profiles without asserting move correspondence or causal attribution. Finally, we quotient all legal candidates realizing a fixed endpoint profile by a deterministic mechanism signature, obtaining a candidate-complete, edge-selector-relative mechanism repertoire. In a complete audit of six game records, 759 positions, and 63,365 legal candidate systems, 2,374 endpoint/profile systems compress to 4,131 mechanism-signature classes, a factor of approximately 15.34. For same-actor-next comparisons, 1,868 profiles are retained, 1,246 retain their repertoire, and 589 retain the complete signature multiplicity census. Thus multiplicity stability implies repertoire stability, which implies profile retention, while both converses fail. The framework ranks no move, uses no evaluation value, and makes no best-move claim; it studies exact finite distinctions and their certified structural dynamics.
Files
discernibility_profiles_shogi_v1_0.pdf
Additional details
References
- Y. Ueoka (Shiki Ueoka), Nagi, Akari, and Sui, Foundations of Shogi Mathematics: Initial Axioms, Check Classification, Capture Relations, and Resource-Aware Interposition Contraction, Zenodo, 2026. doi:10.5281/zenodo.21478624.
- Y. Ueoka (Shiki Ueoka), Nagi, Akari, and Sui, Reply-Induced Deletion Geometry in Shogi: Incidence Structures, Fragility Spectra, and Co-Deletion Graphs, Zenodo, 2026. doi:10.5281/zenodo.21709991.
- Y. Ueoka (Shiki Ueoka), Nagi, Akari, and Sui, Query-Relative Soundness of Legal-Reply Compression in Shogi: Quotient Criteria, Canonical Repair, and Action-Edge Counterexamples, Zenodo, 2026. doi:10.5281/zenodo.21710354.
- Y. Ueoka (Shiki Ueoka), Nagi, Akari, and Sui, Query-Relative Quotients and Certificate- Carrying Observation Reducts: Generators, Modular Composition, and Position-Relative Reduction on Finite Sets of Legal Shogi Moves, Zenodo, 2026. doi:10.5281/zenodo.21758867.
- Z. Pawlak, "Rough Sets," International Journal of Computer & Information Sciences, vol. 11, pp. 341–356, 1982. doi:10.1007/BF01001956.
- A. Skowron and C. Rauszer, "The Discernibility Matrices and Functions in Information Systems," in R. Słowiński (ed.), Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362, Springer, 1992. doi:10.1007/978-94-015-7975- 9_21.
- J. G. Bazan, A. Skowron, and P. Synak, "Dynamic Reducts as a Tool for Extracting Laws from Decision Tables," in Methodologies for Intelligent Systems, Lecture Notes in Computer Science 869, pp. 346–355, Springer, 1994. doi:10.1007/3-540-58495-1_35.
- A. Mary, "Enumeration of Minimal Transversals of Hypergraphs of Bounded VC-Dimension," arXiv:2407.00694v4, 2026. doi:10.48550/arXiv.2407.00694.
- H. Kameko, S. Mori, and Y. Tsuruoka, "Mapping between Move Expressions and Positions for Shogi Commentary Grounding," Proceedings of the Game Programming Workshop 2014, pp. 202–209, Information Processing Society of Japan, 2014. IPSJ record 106523.
- Y. Morioka and C. Sakama, "Building an AI System That Can Explain the Meaning of a Move in Tsume-Shogi," IPSJ SIG Technical Report 2023-GI-49, no. 15, pp. 1–8, 2023. IPSJ record 225276.
- T. Kikkawa and T. Ito, "Improving a Readout-Based Visualization System for Explaining Move Intentions in Shogi AI," Proceedings of the Game Programming Workshop 2025, pp. 137–142, 2025. IPSJ record 2005516.
- Y. Nishihara, R. Takayama, K. Hishida, and R. Yamanishi, "Support for Understanding Shogi Positions for Beginners by Evaluating Contested Areas and King Danger from Piece Placement," Journal of Japan Society for Fuzzy Theory and Intelligent Informatics, vol. 30, no. 6, pp. 796–803, 2018. doi:10.3156/jsoft.30.6_796.
- Y. Imai, "Shogi and Frieze Group," arXiv:2401.08591v2, 2024. doi:10.48550/arXiv.2401.08591.
- S. Ishii and T. Tanaka, "High-Precision Estimation of the State-Space Complexity of Shogi via the Monte Carlo Method," arXiv:2604.06189, 2026. doi:10.48550/arXiv.2604.06189.