scientific article; zbMATH DE number 2124071

MaRDI QIDQ4831470zbMATH OpenFDO

Authors Steven Byrnes

Publication date 3 January 2005

Full work available at URL https://eudml.org/doc/128301

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Partial orders, general (06A06) 2-person games (91A05) Combinatorial games (91A46)

Recommendations

• scientific article; zbMATH DE number 7075886
• Advances in finding ideal play on poset games
• Flipping the winner of a poset game
• Advances in finding ideal play on poset games
• The complexity of poset games

Cited in

(19)

• Games of chains and cutsets in the Boolean lattice. II
• Chomp on numerical semigroups
• Raid games across a set with cyclic order
• Complexity, appeal and challenges of combinatorial games
• Periodicity and arithmetic-periodicity in hexadecimal games
• Winning ways of weighted poset games
• Proper 2-coloring game on some trees
• Pomax games -- a family of integer-valued partizan games played on posets
• Enumerative properties of posets corresponding to a certain class of games of no strategy
• Advances in finding ideal play on poset games
• Strong convergence in posets
• scientific article; zbMATH DE number 1076137 (Why is no real title available?)
• scientific article; zbMATH DE number 1944398 (Why is no real title available?)
• The complexity of poset games
• On the complexity of computing winning strategies for finite poset games
• Thinning thickets
• A vertex and edge deletion game on graphs
• scientific article; zbMATH DE number 4189816 (Why is no real title available?)
• Flipping the winner of a poset game

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831470)