Indexed metadata
One Pile Nim with Arbitrary Move Function
Arthur Holshouser, Harold Reiter
Source 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 , where is the previous move size and is an arbitrary function.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.