One Pile Nim with Arbitrary Move Function

Abstract

This paper solves a class of combinatorial games consisting of one-pile counter pickup games for which the maximum number of counters that can be removed on each successive move equals f(t), where t is the previous move size and f is an arbitrary function. The purpose of this paper is to solve a class of combinatorial games consisting of one-pile counter… (More)

Topics

Cite this paper

@article{Holshouser2003OnePN, title={One Pile Nim with Arbitrary Move Function}, author={Arthur Holshouser and Harold Reiter}, journal={Electr. J. Comb.}, year={2003}, volume={10} }