The representation of a Sylver Coinage position as an ascending sequence of numbers, none of which can be expressed as a sum with multiples of previous numbers in the sequence.
Every position has a unique canonical representation.
Coin Problem F. G. Frobenius's problem of finding the largest number that cannot be expressed as a sum with multiples of numbers in a given set. The enclosure of such a position is always an ender . See quiet ender . See short . In a game in which two players move alternately, a position is N if the player whose turn it is to move can win.