Poset game

In combinatorial game theory, poset games are mathematicalgames 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.