Computational Modelling for Combinatorial Game Strategies
Logic in Computer Science
2025-12-12 v3 Computer Science and Game Theory
Abstract
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.
Cite
@article{arxiv.2408.03955,
title = {Computational Modelling for Combinatorial Game Strategies},
author = {Răzvan Diaconescu},
journal= {arXiv preprint arXiv:2408.03955},
year = {2025}
}