Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:board_game
|
| gptkbp:category |
two-player game
impartial game |
| gptkbp:describedYear |
1901
|
| gptkbp:firstDescribed |
Charles Bouton
|
| gptkbp:hasRule |
players alternate turns
player who removes last object loses on each turn, a player removes any number of objects from a single heap |
| gptkbp:played_for |
heaps of objects
|
| gptkbp:relatedTo |
gptkb:Sprague–Grundy_theorem
|
| gptkbp:strategy |
different from normal Nim
|
| gptkbp:studiedIn |
combinatorial game theory
|
| gptkbp:variant |
gptkb:Nim
|
| gptkbp:winCondition |
player forced to take last object loses
|
| gptkbp:bfsParent |
gptkb:NIM
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
misère Nim
|