Computational Utilities for the Game of Simplicial Nim

Nelson Penn
Simplicial nim games, a class of impartial games, have very interesting mathematical properties. Winning strategies on a simplicial nim game can be determined by the set of positions in the game whose Sprague-Grundy values are zero (also zero positions). In this work, I provide two major contributions to the study of simplicial nim games. First, I provide a modern and efficient implementation of the Sprague-Grundy function for an arbitrary simplicial complex, and discuss its performance...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.