k-Welter - a generalization of Welter's game (Q1088915): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(87)90073-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2042041839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3944542 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4099541 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5825669 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:42, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | k-Welter - a generalization of Welter's game |
scientific article |
Statements
k-Welter - a generalization of Welter's game (English)
0 references
1987
0 references
Finitely many coins are placed on distinct squares of a semi-infinite linear board ruled into squares numbered 0,1,2,.... Each of the two players alternately moves a coin to a lower unoccupied square, at most k squares from its present position, where k is an arbitrary fixed positive integer. The player first unable to move loses and his opponent wins. We give complete solutions for the case of two coins for any k; and for any number of coins when \(k=2^ m-1\) (m\(\geq 1)\). We also prove that, for any k, the Sprague-Grundy function of the game is invariant under translations of coins by \(k+1\).
0 references
Welter's game
0 references
semi-infinite linear board
0 references
Sprague-Grundy function
0 references