Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:board_game
combinatorial game |
| gptkbp:category |
zero-sum game
perfect information game turn-based game |
| gptkbp:firstDescribed |
gptkb:Charles_Leonard_Bouton
1901 |
| gptkbp:hasMisèreVariant |
gptkb:misère_Nim
|
| https://www.w3.org/2000/01/rdf-schema#label |
multi-heap Nim
|
| gptkbp:movement |
remove any number of objects from a single heap
|
| gptkbp:numberOfHeaps |
multiple
|
| gptkbp:played_for |
heaps of objects
|
| gptkbp:playsFor |
two players
|
| gptkbp:relatedTo |
impartial games
|
| gptkbp:solvedBy |
gptkb:Sprague-Grundy_theorem
|
| gptkbp:strategy |
based on binary XOR (nimber) of heap sizes
|
| gptkbp:variant |
gptkb:Nim
|
| gptkbp:winCondition |
player who removes the last object wins
|
| gptkbp:bfsParent |
gptkb:Nim_game
|
| gptkbp:bfsLayer |
8
|