Poset game
In combinatorial game theory, poset games are mathematical games of strategy, generalizing many well-known games such as Nim and Chomp. In such games, two players start with a poset (a partially ordered set), and take turns choosing one point in the poset, removing it and all points that are greater. The player who is left with no point to choose, loses.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Poset game
In combinatorial game theory, poset games are mathematical games of strategy, generalizing many well-known games such as Nim and Chomp. In such games, two players start with a poset (a partially ordered set), and take turns choosing one point in the poset, removing it and all points that are greater. The player who is left with no point to choose, loses.
has abstract
En teoría de juegos combinator ...... un punto para elegir, pierde.
@es
In combinatorial game theory, ...... ith no point to choose, loses.
@en
Wikipage page ID
32,883,354
page length (characters) of wiki page
Wikipage revision ID
882,262,859
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
En teoría de juegos combinator ...... un punto para elegir, pierde.
@es
In combinatorial game theory, ...... ith no point to choose, loses.
@en
label
Juego poset
@es
Poset game
@en