Nimhoff games (Q1177944): Difference between revisions

Nimhoff generalizes Nim by allowing the additional moves: remove \(a_ i\) tokens from pile \(i\) \((i=1,\dots,n)\) (not all \(a_ i=0\)) subject to some relation \(R(a_ 1,\dots,a_ n)\). For example, with \(n=2\), \(a_ 1=a_ 2\). Algorithms are given for calculating the Sprague-Grundy function for normal classes of Nimhoff games.