One-pile misère Nim for three or more players (Q2469051): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2703803 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:18, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-pile misère Nim for three or more players |
scientific article |
Statements
One-pile misère Nim for three or more players (English)
0 references
1 February 2008
0 references
Summary: The analysis of the classical game of Nim relies on binary representation of numbers as shown in the books of Berlekamp and Gardener. There is considerable interest in generalizations and modifications of the game. We will consider one-pile misère Nim for more than two players. In the case of three or more players, the impartial game theory results rarely apply. In this note, we analyze the game in a variety of cases where alliances are formed among the players.
0 references
