The skeletion of an impartial game and the Nim-function of Moore's Nimk
暂无分享,去创建一个
For any finite impartial two-player gameG of perfect information without chance moves, we define the skeletonS (G), another game of the same class, which economically represents the significant structure ofG. We then employ the skeleton of (k+1)-heap Nimk to discover a simple formula for its nim-function (also called “grundy function”).
[1] Claude Berge,et al. The Theory Of Graphs , 1962 .
[2] C. L. Bouton. Nim, A Game with a Complete Mathematical Theory , 1901 .
[3] J. Conway. On Numbers and Games , 1976 .
[4] R. Sprague. Über mathematische Kampfspiele , 1935 .
[5] E. H. Moore. A Generalization of the Game Called Nim , 1910 .
[6] Cedric A. B. Smith. Graphs and composite games , 1966 .