- Zero game
In
combinatorial game theory , the zero game is the game where neither player has any legal options. Therefore, the first player automatically loses, and it is a second-player win. The zero game has aSprague-Grundy value of zero. The combinatorial notation of the zero game is: { | }.A zero game is the opposite of the
star (game) {0|0}, which is a first-player win since either player must (if first to move in the game) move to a zero game, and therefore win."The Zero Game" is also the title of a novel by
Brad Meltzer .prague-Grundy value
All second-player win games have a Sprague-Grundy value of zero, though they may not be the zero game.
For example, normal Nim with two identical piles (of any size) is not the zero game, but has value 0, since it is a second-player winning situation whatever the first player plays.It is not a
fuzzy game because first player has no winning option.Examples
Simple examples of zero games include
Nim with no piles or aHackenbush diagram with nothing drawn on it.
Wikimedia Foundation. 2010.