Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:board_game
combinatorial game |
| gptkbp:hasMaximumPlayers |
2
|
| gptkbp:hasMinimumPlayers |
2
|
| gptkbp:hasProperty |
impartial game
perfect information |
| gptkbp:hasRule |
On each turn, a player removes any number of objects from a single pile
The player who removes the last object wins (normal play) Players take turns removing objects from piles The player who removes the last object loses (misère play) |
| gptkbp:hasVariant |
gptkb:Nimble
gptkb:misère_Nim gptkb:single-pile_Nim |
| gptkbp:hasWinningStrategy |
binary digital sum (Nim-sum) of pile sizes is zero for losing positions
|
| gptkbp:hasYearOfOrigin |
1901
|
| https://www.w3.org/2000/01/rdf-schema#label |
multi-pile Nim
|
| gptkbp:originatedIn |
gptkb:Charles_Leonard_Bouton
|
| gptkbp:popularFor |
computer science
mathematics education puzzle games |
| gptkbp:relatedTo |
gptkb:mathematics
gptkb:Sprague–Grundy_theorem gptkb:Nimbers binary arithmetic game theory |
| gptkbp:bfsParent |
gptkb:NIM
|
| gptkbp:bfsLayer |
6
|