One pile Nim with arbitrary move function (Q1408547): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One pile Nim with arbitrary move function |
scientific article |
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
