Zero game
In combinatorial game theory, the zero game is the game where neither player has any legal options. Therefore, under the normal play convention, the first player automatically loses, and it is a second-player win. The zero game has a Sprague–Grundy value of zero. The combinatorial notation of the zero game is: { | }. A zero game should be contrasted with 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.
Wikipage redirect
differentFrom
primaryTopic
Zero game
In combinatorial game theory, the zero game is the game where neither player has any legal options. Therefore, under the normal play convention, the first player automatically loses, and it is a second-player win. The zero game has a Sprague–Grundy value of zero. The combinatorial notation of the zero game is: { | }. A zero game should be contrasted with 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.
has abstract
En la teoría de juegos combina ...... cero y, por lo tanto, ganar.
@es
In combinatorial game theory, ...... zero game, and therefore win.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
770,035,829
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
En la teoría de juegos combina ...... cero y, por lo tanto, ganar.
@es
In combinatorial game theory, ...... zero game, and therefore win.
@en
label
Juego cero
@es
Zero game
@en