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.

翻译：我们开发了一个通用的计算模型，可有效用于确定具体有限组合博弈中必胜策略的存在性。该建模基于（等式）逻辑，涉及代数规约中的先进技术，并可由OBJ家族等等式编程系统执行。我们展示了这如何为涉及组合博弈的策略问题提供一种实验数学的形式。我们通过定义通用方法并结合案例研究进行说明来实现这一点。