Editing Nim (section)

{{Short description|Game of strategy}}
{{about|the mathematical game of strategy|the programming language|Nim (programming language)|other uses|Nim (disambiguation)}}
{{Infobox game
| name = Nim
| image = NimGame.svg
| caption = Matches set up in rows for a game of Nim. Players take turns to choose a row and remove any number of matches from it.
| years = 
| genre =  {{ubl|[[Mathematical game]]|[[abstract strategy game]]}}
| players = 2
| setup_time = 
| playing_time = 
| random_chance = None
| skills = 
}}
'''Nim''' is a [[mathematical game|mathematical]] [[combinatorial game]] in which two players take turns removing (or "nimming") objects from distinct heaps or piles. On each turn, a player must remove at least one object, and may remove any number of objects provided they all come from the same heap or pile. Depending on the version being played, the goal of the game is either to avoid taking the last object or to take the last object.

Nim is fundamental to the [[Sprague–Grundy theorem]], which essentially says that every [[impartial game]] is equivalent to a nim game with a single pile.