  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.
