Fixed-Value Representation in Combinatorial Games: Partizan Dataset and Reproducibility Package

Dataset and reproducibility package for research on what structural diversity remains when exact combinatorial-game value is held fixed. The study covers bounded Digraph Placement and Domineering and compares equality-only, novelty-guided, and structural acquisition. What is included • Compact reproducibility archive (87 MB): protocols, source snapshots, compact authorities, figures, and replay tooling.• Full evidence archive (885 MB): the complete immutable event and certificate tree for independent replay. Explore before downloading Interactive fixed-value atlas: https://devinnicholson.github.io/partizan-reproducibility/Source code and quick-start instructions: https://github.com/devinnicholson/partizan-reproducibility The interactive atlas shows all 21,697 quotient-distinct graph forms retained by the order-7 study. The compact archive is the recommended starting point; use the full archive for complete scientific replay. Use cases include combinatorial game theory, exact verification, proof-carrying generation, machine-learning-guided search, computational creativity, and reproducible research. SHA-256 (compact ZIP): 7a33cbdf986924e0a9902bbbffb627ba74363414b072468c6e3ce11b5b1c66a3SHA-256 (full TAR.GZ): 59e8a1e2d68801f605eb98a2632c5a6265858365af8018af51c68f2e6f45e197