2024/07/23 by Răzvan Diaconescu, Diaconescu, Răzvan
Computer Science · Social Sciences · #Artificial Intelligence in Games #Computer Science and Game Theory (cs.GT) #Digital Games and Media #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · pdf · doi:10.48550/arxiv.2408.03955
openalex publication_date 2024/07/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is (equational) logic-based involving advanced techniques from algebraic specification, and it can be executed by equational programming systems such as those from the OBJ-family. We show how this provides a form of experimental mathematics for strategy problems involving combinatorial games. We do this by defining general methods and by illustrating these with case studies.