Statements (48)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:board_game
gptkb:strategy |
| gptkbp:category |
combinatorial game theory
mathematical recreation |
| gptkbp:component |
coins
stones matches heaps of objects |
| gptkbp:etymology |
possibly from German 'nimm' (take!)
|
| gptkbp:fieldOfStudy |
gptkb:mathematics
computer science game theory recreational mathematics |
| gptkbp:firstDescribed |
gptkb:Charles_Leonard_Bouton
1901 |
| gptkbp:game |
gptkb:Wythoff's_game
gptkb:Take-away_game gptkb:Kayles |
| gptkbp:genre |
gptkb:strategy
|
| gptkbp:hasRule |
the player who removes the last object loses (misère play)
the player who removes the last object wins (normal play) players take turns removing objects from heaps on each turn, a player removes one or more objects from a single heap |
| https://www.w3.org/2000/01/rdf-schema#label |
Nim (game)
|
| gptkbp:inPopularCulture |
featured in the film 'Last Year at Marienbad'
referenced in computer science used in AI research |
| gptkbp:languageOfOrigin |
English
|
| gptkbp:mathematical_property |
impartial game
perfect information zero-sum game finite game no chance element |
| gptkbp:method |
gptkb:binary_digital_sum_(nimber)
|
| gptkbp:notableFeature |
basis for combinatorial game theory
can be played with any number of heaps can be played with any number of objects per heap first solved impartial game |
| gptkbp:numberOfPlayers |
2
|
| gptkbp:objective |
to avoid taking the last object (normal play)
to take the last object (misère play) |
| gptkbp:origin |
ancient game
|
| gptkbp:relatedConcept |
gptkb:Sprague–Grundy_theorem
|
| gptkbp:solvedBy |
yes
|
| gptkbp:strategy |
winning strategy based on binary XOR of heap sizes
winning strategy exists for normal play |
| gptkbp:bfsParent |
gptkb:The_Dots-and-Boxes_Game
|
| gptkbp:bfsLayer |
7
|