One pile Nim with arbitrary move function (Q1408547)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: One pile Nim with arbitrary move function |
scientific article; zbMATH DE number 1985382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One pile Nim with arbitrary move function |
scientific article; zbMATH DE number 1985382 |
Statements
One pile Nim with arbitrary move function (English)
0 references
24 September 2003
0 references
Summary: 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.
0 references
Nim games
0 references
