Keywords: Data Science, Game Theory, Subtraction Games, Combinatorics
We present a computational methodology for the structure of subtraction games. One of the oldest problems in combinatorial game theory is to characterize the structure of subtraction games. Although the structure can be analyzed recursively, at present, a methodology for explicitly characterizing the structure of a subtraction game is not (yet) known. In the last two years, our team characterized the (eventual) period lengths of the Sprague-Grundy values of subtraction games with 3 parameters. Recently, however, we greatly generalized these results, to fully characterize the complete sequences of SG-values, including both the periodic and the pre-periodic portions of the sequences. We have analyzed 72 TB of data about this problem, to verify this computational approach to the analysis of these games.