scientific article; zbMATH DE number 2124071

zbMATH Open1128.91310MaRDI QIDQ4831470FDOQ4831470

Authors: Steven Byrnes 

Publication date: 3 January 2005

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

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (15)

• Raid games across a set with cyclic order
• On the complexity of computing winning strategies for finite poset games
• Complexity, appeal and challenges of combinatorial games
• Periodicity and arithmetic-periodicity in hexadecimal games
• Title not available (Why is that?)
• Winning ways of weighted poset games
• Games of chains and cutsets in the Boolean lattice. II
• Flipping the winner of a poset game
• Advances in finding ideal play on poset games
• A vertex and edge deletion game on graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proper 2-coloring game on some trees
• The Complexity of Poset Games
• Title not available (Why is that?)

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)