Timeline for Generalisation of Nim
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 29, 2018 at 19:58 | history | edited | ManyPinkHats | CC BY-SA 4.0 |
deleted 4 characters in body
|
| Feb 27, 2016 at 3:59 | comment | added | Mark S. | When 0 is not in the validmove array, this game is called a "finite subtraction game" or a "subtraction game with a finite subtraction set". The nimber sequence will not always be purely periodic. For example, if the validmove array is $\{3,4,6,10\}$, the nimber sequence (with commas and braces omitted since the nimbers are all less than $10$) is $00011122203314\overline{00201312}$. These types of games are discussed in many combinatorial game theory texts, including the undergraduate textbook "Lessons in Play: An Introduction to Combinatorial Game Theory" where the above example comes from. | |
| Nov 5, 2015 at 15:15 | history | bounty ended | ghosts_in_the_code | ||
| May 27, 2015 at 7:57 | vote | accept | ghosts_in_the_code | ||
| May 26, 2015 at 15:22 | history | edited | Julian Rosen | CC BY-SA 3.0 |
added 183 characters in body
|
| May 26, 2015 at 15:05 | history | edited | Julian Rosen | CC BY-SA 3.0 |
added 17 characters in body
|
| May 26, 2015 at 14:49 | history | answered | Julian Rosen | CC BY-SA 3.0 |