Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Sprague–Grundy theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Nimbers=== The special names <math>*0</math>, <math>*1</math>, and <math>*2</math> referenced in our example game are called '''''[[nimber]]s'''''. In general, the nimber <math>*n</math> corresponds to the position in a game of nim where there are exactly <math>n</math> objects in exactly one heap. Formally, nimbers are defined inductively as follows: <math>*0</math> is <math>\{\}</math>, <math>*1 = \{*0\}</math>, <math>*2 = \{*0, *1\}</math> and for all <math>n \geq 0</math>, <math>*(n+1) = *n \cup \{*n\}</math>. While the word ''nim''ber comes from the game ''nim'', nimbers can be used to describe the positions of any finite, impartial game, and in fact, the Sprague–Grundy theorem states that every instance of a finite, impartial game can be associated with a ''single'' nimber.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)